| 摘要 |
The invention concerns a cryptographic method for generating public keys (K) and private keys (K') which consists in: selecting two distinct first numbers p and q, of neighbouring value and calculating the number n equal to the product of p.q; calculating the lowest common multiple of the numbers (p-1) and (q-1): lambda (n) = PPCM(p-1, q-1); determining a number g, 0<g</=n<2> which verifies the two following conditions: a) g is invertible modulo n<2>; and b) ord(g,n<2>) = 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 consists in calculating the cryptogram c 0 g<m>mod n<2>.
|
