Method of generating prime numbers proven suitable for chip cards
US9596080B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 12, 2012 |
| Grant date | Mar 14, 2017 |
| Priority date | — |
| Expiry date | Dec 12, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/24
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
This disclosure relates to methods for generating a prime number, which can be implemented in an electronic device. An example method can include calculating a candidate prime number using a formula Pr=2P·R+1, where P is a prime number and R is an integer. The method can also include applying the Pocklington primality test to the candidate prime number and rejecting the candidate prime number if it fails the Pocklington test. The integer can be generated from an invertible number belonging to a set of invertible elements modulo the product of numbers belonging to a group of small prime numbers greater than 2, where the candidate prime number is not divisible by any number of the group. The prime number P having a number of bits equal to within one bit, to half or a third of the number of bits of the candidate prime number.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.