A public key cryptosystem and a signature scheme based on discrete logarithms-英文文献.pdf

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-31, NO. 4, JULY 1985 469 A Public Key Cryptosystem and a S ignature Scheme Based on D iscrete Loga rithms TAHER ELGAMAL, MEMBER,IEEE Abstract-A new signature scheme is proposed, together with an imple- Hence both A and B are able to compute K,,. But, for an mentation of the Diffie-Hellman key distribution scheme that achieves a intruder, computing KA B appears to be difficult. It is not public key cryptosystem. The security of both systems relies on the yet proved that breaking the system is equivalent to com- difficulty of computing discrete logarithms over finite fields. puting discrete logarithms. For more details refer to [3]. In any of the cryptographic systems based on discrete I. INTRODUCTION logarithms, p must be chosen such that p - 1 has at least N 1976, Diffie and Hellman [3] introduced the concept one large prime factor. If p - 1 has only small prime I of public key cryptography. Since then, several attempts factors, then computing discrete logarithms is easy (see[S]). have been made to find practical public key systems (see, Now suppose that A wants to send B a messagem, for example, [6], [7], [9]) depending on the difficulty of where 0 I m I p - 1. F irst A chooses a number k uni- solv