发明公开
EP2791784A1 PROCEDE DE GENERATION DE NOMBRES PREMIERS PROUVES ADAPTE AUX CARTES A PUCE
审中-公开
用于生产证实的化合物用于智能卡的适当的原号码
- 专利标题： PROCEDE DE GENERATION DE NOMBRES PREMIERS PROUVES ADAPTE AUX CARTES A PUCE
- 专利标题（英）： Method for generating prime numbers proven suitable for chip cards
- 专利标题（中）： 用于生产证实的化合物用于智能卡的适当的原号码
-
申请号： EP12815734.4申请日： 2012-12-12
-
公开(公告)号： EP2791784A1公开(公告)日： 2014-10-22
- 发明人: FEIX, Benoît , CLAVIER, Christophe , PAILLIER, Pascal , THIERRY, Loïc
- 申请人： Inside Secure
- 申请人地址： Rue de la Carrière de Bachasson, CS 70025 Arteparc Bachasson, Bât. A 13590 Meyreuil FR
- 专利权人： Inside Secure
- 当前专利权人： Inside Secure
- 当前专利权人地址： Rue de la Carrière de Bachasson, CS 70025 Arteparc Bachasson, Bât. A 13590 Meyreuil FR
- 代理机构： de Roquemaurel, Bruno
- 优先权： FR1161739 20111215; FR1161740 20111215; FR1161741 20111215; FR1161742 20111215; FR1201550 20120530
- 国际公布： WO2013088066 20130620
- 主分类号： G06F7/72
- IPC分类号： G06F7/72
摘要：
The invention relates to a method for generating prime numbers, which is implemented in an electronic device (DV), wherein the method includes steps of: calculating a candidate prime number (Pr), having a number of bits (L), using the formula Pr = 2P × R + 1, wherein P is a prime number, and R is an integer; using the Pocklington primality test on the candidate prime number; rejecting the candidate prime number if it fails the Pocklington test; and generating the integer (R) from a multiplicative inverse (X), belonging to a set of multiplicative inverse elements modulo, the product (Pv) of numbers (Qj) belonging to a group of small prime numbers greater than 2, so that the candidate prime number (Pr) is not divisible by any of the numbers from the group. The prime number P has a number of bits equal to a bit near one-half or one-third the number of bits of the candidate prime number.
信息查询
