Method of generating proven prime numbers suitable for being implemented in a smart card
US9577826B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 12, 2012 |
| Grant date | Feb 21, 2017 |
| Priority date | — |
| Expiry date | Jul 13, 2033 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/24
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of generating a prime number from another prime number using the formula Pr=2P·R+1, where P is a prime number having a number of bits lower than that of the candidate prime number, and R is an integer, and applying the Pocklington primality test to the candidate prime number, the candidate prime number being proven if it passes the Pocklington test. According to the invention, the size in number of bits of the candidate prime number is equal to three times the size of the prime number, to within one unit, the generated candidate prime number being retained as candidate prime number only if the quotient of the integer division of the integer by the prime number is odd.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.