Abstract:
PROBLEM TO BE SOLVED: To generate a session key for authentication and secure data transfer.SOLUTION: A device 20 for generating a session key kwhich is known to a first communication partner (P; T) and a second communication partner (T; P), for the first communication partner (P; T), from secret information kwhich may be determined by the first and the second communication partners, includes: means 22 for obtaining a random number (r; r); means 24 for calculating the session key kusing a concatenation of at least a part of the random number (r; r) and a part of the secret information k; and means 28 for using the session key kfor communication with the second communication partner.
Abstract:
PROBLEM TO BE SOLVED: To protect from side channel attacks a device for generating a session key, which is known to a first communication partner and a second communication partner, for the first communication partner, from secret information which may be determined by the first and second communication partners.SOLUTION: A device includes: a means 22 for obtaining a random number (r;r); a means 24 for calculating a session key (k) using a concatenation of at least a part of the random number (r;r) and a part of secret information (k); and a means 28 for using the session key (k) for communication with a second communication partner.
Abstract:
The device for calculation of a multiplication of a multiplier and a multiplicand consists of a device (40) for performing an exact three operand addition in addition to a device(412) for performing an approximated operand addition, and a device (417) for calculating look-ahead parameters using an approximated intermediate result (414) calculated by the device (412). The device for performing the exact three operand addition is also configured in such a way that it can carry out an exact three-operand addition (400') in a current iteration step using the exact intermediate result for the current iteration step and using the look-ahead parameters, calculated by the device (417), for the current iteration step. As a result, the long-number calculator can continuously perform three operand additions and is no longer required to lie idle while look-ahead parameters are calculated. This results in a significant increase in performance when cryptographic calculations are performed.
Abstract:
A processor chip comprising a logic chip (12) with a logic circuit (12a) and a non-volatile memory (12b) in addition to a memory chip (14) with a non-volatile memory. A key (k) is stored in the non-volatile memory (12b) of the logic chip (12) using electric safeguards (13a,13b,13c). Personalization information (13d), signaling that the logic chip is allocated to a memory chip, is also stored. A chip identification (m), which is encrypted with the key (k), is stored in the memory chip (14) in an ID storage area (16). When the processor is run up, initial verification occurs as to whether the encrypted logic chip identification stored in the memory chip is authentic or not. the logic chip can thus be personalized in a simple and economical manner in order to protect against attacks with regard to remoteness or manipulation of the memory chip.
Abstract:
In order to determine a result of a modular exponentiation, a randomization auxiliary number based on the product of the public key and of the private key is set to less than "1" in order to randomize the exponent. This randomization auxiliary number can be derived without special functionalities from the private RSA data record. This enables an low-effort exponent randomization to be universally carried out for each security protocol in order to carry out a digital signature that is secure from side channel attacks.
Abstract:
The invention relates to a processing device (12) comprising a plurality of electronic safety units (16) for storing confidential data and a device (14) for reading said plurality of electronic safety units in order to determine confidential data. The storing of said data, for example a secret key for identifying the processing device, i.e. a chip card in which said processing device is placed, makes it possible to provide the electronic safety units with a sure, efficient and at the same time flexible mode and manner for inputting delicate information in an integrated circuit.
Abstract:
The invention relates to a method for securing an exponentiation calculation by means of the Chinese remainder theorem, wherein the joining step (16) in particular, during which, preferably, the joining algorithm according to Garner is used, is monitored (18) for correctness prior to the output (24) of the result of the joining step. Verification occurs directly before the output of the result of the exponentiation calculation of the joining algorithm in order to be able to prevent outputs of an incorrect result, for example as a result of a hardware error attack, so that said error attack can be warded off.
Abstract:
The invention relates to a register cell which comprises a first input (10) for a data unit to be written into said register cell. The register cell further comprises a second input (12) for a negated data unit to be written into the register cell. A first pair (14) of cross-coupled inverters (14a, 14b) can be coupled with the first input (10) as the first memory circuit. A second pair of cross-coupled inverters (16a, 16b) can be coupled with the second input (12) as the second memory circuit. The use of two cross-coupled pairs of inverters allows to initialize (30) the first input (10) and the second input (12) of the register either at a high voltage status (precharge) or at a low voltage status (discharge) in such a manner as to render the power consumption of the register cell from one cycle to the next more uniform.
Abstract:
Disclosed is a processor comprising a source register (10) with a content, a destination register (12), an arithmetic unit (14) doing a calculation by using the content of the source register, said calculation being done in several cycles and only a portion of the content of the source register being usable in each cycle, a data bus (18) which is connected to the source register (10), the destination register (12), and the arithmetic unit (14), and a processor control unit which is operable so as to feed the content of the source register in portions to the arithmetic unit and the destination register via the data bus during the calculation process such that the content of the source register is written in the destination register once the calculation is done. The inventive processor makes it possible to copy a register for long operands that are to be processed portion by portion from a source register to a destination register via a limited data bus without using any additional machine cycles.