Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2006-05-30
2006-05-30
Louis-Jacques, Jacques H. (Department: 2134)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000
Reexamination Certificate
active
07054444
ABSTRACT:
The invention concerns a cryptographic method for generating public keys and private keys. Two distinct first numbers p and q, of neighboring value are selected, and the number n equal to the product of p·q is calculated. The lowest common multiple of the numbers (p−1) and (q−1)λ(n)=PPCM(p−1, q−1) is then calculated. A number g, 0<g≦n2, is then determined which verifies the two following conditions: a) g is invertible modulo n2; and b) ord(g,n2)=0 mod n. The public key is formed by the parameters n and g and its private key is formed by the parameters p, q and λ(n)or by the parameters p and q. An encryption method for a number m representing a message, 0≦m<n, involves calculating the cryptogram c=gmmod n2.
REFERENCES:
patent: 5199070 (1993-03-01), Matsuzaki et al.
patent: 6345098 (2002-02-01), Matyas et al.
patent: 6377688 (2002-04-01), Numao
patent: 6480605 (2002-11-01), Uchiyama et al.
Gotoh, Yasuko et al, “A Method for Rapid RSA Key Generation”, Systems and Computers in Japan, vol. 21, No. 8, Jan. 1, 1990, pp. 11-19.
Buchanan & Ingersoll PC
GEMPLUS
Louis-Jacques Jacques H.
Nalven Andrew L.
LandOfFree
Public and private key cryptographic method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Public and private key cryptographic method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Public and private key cryptographic method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3630245