| 摘要 |
PROBLEM TO BE SOLVED: To provide a method for protecting prime number generation against side-channel attacks, particularly, a method for protecting a primality test for executing subtraction or comparison with a prime number table. SOLUTION: A method for generating, by an electronic circuit, at least one prime number by testing the primality of successive candidate numbers for asymmetric encrypted algorithm of RSA type includes a step (43) of testing, for each candidate number, primality with respect to prime numbers of at least one set of consecutive prime numbers, wherein the order of application of the tests is modified at least from one prime number generation to another. COPYRIGHT: (C)2011,JPO&INPIT |
