Abstract: A compiler system including a compiler configured to compile a source code into a machine language code is presented, so that the machine language code is executable on a processing unit, wherein the processing unit comprises an internal register that is changing its state responsive to an execution of the machine language code. The compiler is configured to encrypt the machine language code based on an encryption function that depends on the state of the internal register.

Abstract: A compiler system including a compiler configured to compile a source code into a machine language code is presented, so that the machine language code is executable on a processing unit, wherein the processing unit comprises an internal register that is changing its state responsive to an execution of the machine language code. The compiler is configured to encrypt the machine language code based on an encryption function that depends on the state of the internal register.

Abstract: In a device for calculating a result of a modular exponentiation, the Chinese Residue Theorem (CRT) is used, wherein two auxiliary exponentiations are calculated using two auxiliary exponents and two sub-moduli. In order to improve the safety of the RSA CRT calculations against cryptographic attacks, a randomization of the auxiliary exponents and/or a change of the sub-moduli are performed. Thus, there is a safe RSA decryption and RSA encryption, respectively, by means of the calculating time efficient Chinese Residue Theorem.

Abstract: A method of secure communication in which communication partners (A, B) in each case have a secret (S) and a public code (P), in which the communication partner (A) selects a random number (x) and the communication partner (B) selects a random number (y), in which a first partial code (Ax) is formed by the communication partner (A) and a second partial code (By) is formed by the communication partner (B) by using the public code (P) of the respective partner (B, A) and is transmitted to the respective other communication partner (B, A). A session code (gxy, gyx) is formed from the private random number (x, y), and the partial code (By, Ax) of the respective communication partner (B, A) while using the private secret code (S), the partial codes (Ax, By) and the session codes (gxy, gyx) being calculated in a fashion similar to the Diffie-Hellmann protocol.

Abstract: In a device for calculating a result of a modular exponentiation, the Chinese Residue Theorem (CRT) is used, wherein two auxiliary exponentiations are calculated using two auxiliary exponents and two sub-moduli. In order to improve the safety of the RSA CRT calculations against cryptographic attacks, a randomization of the auxiliary exponents and/or a change of the sub-moduli are performed. Thus, there is a safe RSA decryption and RSA encryption, respectively, by means of the calculating time efficient Chinese Residue Theorem.