Abstract:
Cryptographic methods are known that involve the computation of a non-degenerate bilinear mapping of first and second elements (P 1 , Q 1 ) one of which comprises a secret of a first entity (A). For a mapping implemented as, for example, a Tate pairing, the mapping is computable by applying a predetermined function (f) to the first and second elements (P 1 , Q 1 ) and then exponentiating the result with a known exponent (e pub ). Improvements in respect of computational loading, size of output, and security are enabled for the first party (A) by arranging for the first entity to carry out (12) only part of the mapping, a second entity (B) being used to complete computation (13) of the mapping. Cryptographic applications using these improvements are also disclosed.
Abstract:
A method (200) for transmitting a message between a first electronic device (C) and a second electronic device (MS i ) is described, comprising steps of: - implementing an encryption algorithm, generating (202), by the first electronic device (C), a first data encryption key (K i ) identifying the second electronic device (MS i ) on the basis of a main data encryption key (MK) and an identification code (ID i ) of the second electronic device (MS i ); - implementing said encryption algorithm, generating (203), by the first electronic device (C) and the second electronic device (MS i ), a communication key (K di ) on the basis of said first data encryption key (K i ) and a reference datum (DT).
Abstract:
An encoding/decoding apparatus comprises a central processing unit and an encryption/decryption accelerator coupled to the central processing unit The accelerator comprises an input for input data to be encrypted/decrypted, an arithmetic logic unit coupled to said input for performing selectable operations on data obtained from said input data and an output for encrypted/decrypted data coupled to said arithmetic logic unit.
Abstract:
The invention concerns a method of performing a cryptographic operation comprising: receiving a plurality of binary input values (P 0 ...P N ); splitting said binary input values into a plurality of non-binary digits (P 0 '...P M ') of base r, where r is an integer greater than 2 and not equal to a power of 2; and performing, by a cryptographic block (306) on each of the plurality of non-binary digits, a different modulo r operation to generate at least one output digit (Z 0 '...Z M ') of base r.
Abstract translation:本发明涉及一种执行密码操作的方法,包括:接收多个二进制输入值(P 0 ... P N); 将所述二进制输入值分解为基本r的多个非二进制数字(P 0'... P M'),其中r是大于2且不等于2的幂的整数; 并且通过在所述多个非二进制数字中的每一个上的密码块(306)执行不同的模r操作以生成基本r的至少一个输出数字(Z 0'... Z M')。
Abstract:
The invention concerns a computing method performed by an electronic circuit and an electronic circuit for computing a modular operation with at least one operand (R) having a binary representation, at least comprising iteratively for each bit of this operand: doubling (33) the value of an intermediate result (Z) stored in a first memory element by shifting the bits of the intermediate result towards the most significant bit; and while (34) the most significant bit of the intermediate result is one, updating this intermediate result by subtracting the modulus (n) stored in a second memory element.