公开(公告)号：US09654290B2

公开(公告)日：2017-05-16

申请号：US14572318

申请日：2014-12-16

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto Battistello ,  Christophe Giraud ,  Guillaume Dabosville ,  Laurie Genelle

IPC: G06F21/00 ,  G06F7/72 ,  H04L9/28 ,  H04L9/14 ,  H04L9/00

CPC classification number: H04L9/14 ,  H04L9/002 ,  H04L9/004 ,  H04L2209/12 ,  H04L2209/24

Abstract: Method of integrity verification of public and private cryptographic key pairs in the additive group of integers modulo n, with n being the product of two prime numbers p and q, the method including the following steps: of computation (201), on the basis of the number n, of a public exponent e of the public key, and of a private exponent d of the private key, of two candidate factors p′ and q′ corresponding respectively to the numbers p and q, of verification (206) so as to verify the consistency of the private exponent with respect to the public exponent and to the number n, the verification step involving the candidate factors.

公开(公告)号：US09992016B2

公开(公告)日：2018-06-05

申请号：US15122822

申请日：2015-03-03

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto Battistello ,  Christophe Giraud ,  Guillaume Dabosville ,  Laurie Genelle

IPC: H04L9/14 ,  H04L9/08 ,  H04L9/00 ,  H04L9/30

CPC classification number: H04L9/08 ,  G06F7/72 ,  G06F2207/7204 ,  H04L9/004 ,  H04L9/302

Abstract: Generation of a message m of order λ(n) for a test of the integrity of the generation of a pair of cryptographic keys within the multiplicative group of integers modulo n=p·q, including: —key pair generation including, to generate p and q: a random selection of candidate integers; and a primality test; —a first search of the multiplicative group of integers modulo p for a generator a; —a second search of the multiplicative group of integers modulo q for a generator b; —a third search for a number y, as message m, verifying: 1≤γ≤n−1, where γ=a mod p and γ=b mod q, the first or second search being performed during the primality test.

公开(公告)号：US09755829B2

公开(公告)日：2017-09-05

申请号：US14572163

申请日：2014-12-16

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto Battistello ,  Christophe Giraud

IPC: H04L9/08 ,  H04L9/00 ,  H04L9/30

CPC classification number: H04L9/0861 ,  H04L9/004 ,  H04L9/30

Abstract: Method for generating a pair of public and private cryptographic keys in the additive group of integers modulo n, where n is the product of two prime numbers p and q, the method including the following steps: calculating a public exponent e for said public key, and calculating a private exponent d for said private key from said public exponent and said public modulus, where d·e=1 mod λ(n), λ(n) being the least common multiple between p-1 and q-1, characterized in that the method furthermore comprises a step: of checking to check that λ(n)=0 mod (p-1) and λ(n)=0 mod (q-1).

公开(公告)号：US09680645B2

公开(公告)日：2017-06-13

申请号：US14572233

申请日：2014-12-16

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto Battistello ,  Christophe Giraud ,  Guillaume Dabosville ,  Laurie Genelle

IPC: H04L9/00 ,  H04L9/14 ,  H04L9/30

CPC classification number: H04L9/14 ,  H04L9/002 ,  H04L9/30 ,  H04L9/302 ,  H04L2209/24 ,  H04L2209/26

Abstract: Method of integrity verification of cryptographic key pairs, the method including an integrity test with: at least one first step implementing one of the private and public keys and an initial test datum, the first step making it possible to generate a first result, at least one second step implementing at least the first result and the key not used during the at least one first step, the second step making it possible to generate a second result, and a comparison of the second result and of the initial test datum, characterized in that the test is re-executed upon each positive comparison, and in that the test is executed at least 2 times.