摘要:
L'invention concerne un procédé de calcul cryptographique dans un système cryptographique sur courbe elliptique, le procédé étant exécuté par un dispositif électronique (DV1) et comprenant une opération de multiplication d'un point (P) d'une courbe elliptique par un nombre scalaire, le point présentant des coordonnées affines appartenant à un corps de Galois, l'opération de multiplication comprenant des étapes de détection de l'apparition d'un point à l'infini durant des calculs intermédiaires (ADD, DBL) de l'opération de multiplication, et d'activation d'un signal d'erreur si le point à l'infini est détecté et si le nombre de bits du nombre scalaire traités par l'opération de multiplication est inférieur au rang du bit de poids fort d'un ordre d'un point de base du système cryptographique.
摘要:
The invention relates to a method for managing the memory of a secure microcircuit (SE), comprising steps executed by the microcircuit consisting in: forming a data block (BLi) with executable code and/or data stored in a volatile memory (MEM2) of the microcircuit and to be backed-up outside of the microcircuit; calculating a signature (SGi) of the data block using a first signature key; inserting the calculated signature of the data block into a signature block (BLS); obtaining a current value of a non-volatile counter (CNT) inside the microcircuit; calculating a signature (SGG) of the signature block associated with the current value of the internal counter, using a second signature key; and transmitting the data block, the signature block and the signature of the signature block outside of the microcircuit.
摘要:
The invention relates to a method for sharing a memory (MEM1) between two functional entities (E1, E2), comprising the steps of attributing a first data transformation function (T1) and a first inverse transformation function (I1) to the first functional entity, and attributing a second data transformation function (T2) and a second inverse transformation function (I2) to the second functional entity (E2), the second inverse transformation function (I2) being incompatible with the first transformation function (T1) and the first inverse transformation function (I1) being incompatible with the second transformation function (T2).
摘要:
The invention relates to a method of executing a program, the method comprising steps consisting in: executing an operation (SSG) configured to load an arbitrarily chosen value of an initial datum (sq1 ) belonging to a series of ordered data, executing a series of computation operations (SG, SGC, ESG), distributed in the program, comprising operations each configured to compute a current datum (sq1 ) of the series of data (sq1) as a function of a previous datum (sq1 ), executing a final operation configured to compute a final datum (sq1 ) of the series of data as a function of the current datum, and executing an operation (SQCK, SQFC) configured to detect an error of execution of the program by comparing the current datum of the series of data with an expected value, the final datum exhibiting an expected value independent of the number (n) of data in the series of data.
摘要:
A computer program provides fast generation and testing of probable prime numbers for cryptographic applications. The program instructions executed on computer hardware execute steps that include a smart increment program function that finds successive candidates using a table of congruent values that are relatively prime to a selected set of very small primes do identify an increment to the next candidate, thereby sieving out about 3/4ths of the really obvious components that don't need to be subjected to trial division. The program instructions also include a small primes testing program function that speeds trial division against a list of small primes by carrying out the division on modular reduced values rather than the very large candidates themselves. Only the about 10 % of the candidates that pass the small primes test will then be subjected to more rigorous, but time consuming, probable primality tests.