Protection of a prime number generation for an rsa algorithm
AssigneesProton World International N.V., STMicroelectronics (Rousset) SAS
InventorsJoan Daemen, Frank Cuypers, Gilles Van Assche, Pierre-Yvan Liardet
Life of this patent
Estimating the term…
Abstract
A method for protecting a generation, by an electronic circuit, of at least one prime number by testing the prime character of successive candidate numbers, including: for each candidate number: the calculation of a reference number involving at least one first random number, and at least one primality test based on modular exponentiation calculations; and for a candidate number having successfully passed the primality test: a test of consistency between the candidate number and its reference number.
Claims11
A method for protecting generation, by an electronic circuit (1), of at least one prime number by testing a prime character of successive candidate numbers, comprising:
- for each candidate number:
- calculating a reference number involving at least one first random number;
- and
- performing at least one primality test based on modular exponentiation calculations;
- and
- for a candidate number having successfully passed said primality test:
- testing a consistency between the candidate number and its reference number.
Dependencies are inferred from the claim text.