摘要 |
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)lambda(n)=PPCM(p-1, q-1) is then calculated. A number g, 0<G<=N<SUP>2</SUP>, is then determined which verifies the two following conditions: a) g is invertible modulo n<SUP>2</SUP>; and b) ord(g,n<SUP>2</SUP>)=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 lambda(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=g<SUP>m </SUP>mod n<SUP>2</SUP>. |