| 摘要 |
<p>A new scheme for fast realization of encryption, decryption and authentication which can overcome the problems of the RSA cryptosystem is disclosed. The encryption obtains a ciphertext C from a plaintext M according to C IDENTICAL M<e> (mod n) using a first secret key given by N (>/= 2) prime numbers p1 , p2 , ........ , pN , a first public key n given by a product p1 <k 1> p2 <k 2> ........ pN <k N> where k1, k2, ........ , kN are arbitrary positive integers, a second public key e and a second secret key d which satisfy ed IDENTICAL 1 (mod L) where L is a least common multiple of p1-1, p2-1, ........ , pN-1. The decryption recovers the plaintext M by obtaining residues Mp 1 k 1, Mp 2 k 2, ........ , Mp N k N modulo p1 <k 1> , p2 <k 2> , ........ , pN <k N> , respectively, of the plaintext M using a prescribed loop calculation with respect to the first secret key p1 , p2 , ........ , pN , and by applying the Chinese remainder theorem to the residues Mp 1 k 1 , Mp 2 k 2 , ........ , Mp N k N . This encryption/decryption scheme can be utilized for realizing the authentication. <IMAGE></p> |
