Academic
Publications
A public key cryptosystem and a signature scheme based on discrete logarithms

A public key cryptosystem and a signature scheme based on discrete logarithms,IEEE Transactions on Information Theory,T. Eigamal

A public key cryptosystem and a signature scheme based on discrete logarithms   (Citations: 2066)
BibTex | RIS | RefWorks Download
Cumulative Annual
    • ...The second classical problem is the discrete logarithm problem (DLP) over a finite field ℤ p , p being a large prime; the ElGamal protocol 14 and all its variants are based on this problem...

    Joan-Josep Climentet al. Key exchange protocols over noncommutative rings. The case of

    • ...The security of various current cryptosystems, such as the Diffie–Hellman key agreement protocol [6], the ElGamal cryptosystem [8], and some signature schemes [8,16], rely on the hardness of DLPs...
    • ...The security of various current cryptosystems, such as the Diffie–Hellman key agreement protocol [6], the ElGamal cryptosystem [8], and some signature schemes [8,16], rely on the hardness of DLPs...

    Jung Hee Cheonet al. Accelerating Pollard’s Rho Algorithm on Finite Fields

    • ...It is based on a simple modification of the ElGamal encryption scheme [26]: let be a group of prime order and let be a generator of ; Alice and Bob publish the public keys and (respectively) and keeps secret their discrete logarithms and . To send a message to Alice, a sender picks uniformly at random an integer and transmits the pair where and . The proxy is given the re-encryption key to divert ciphertexts from Alice to Bob via computing ...

    Benoît Libertet al. Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption

    • ...Modular division and multiplication operations, the fundamental arithmetic operations, have important application in many prevailing public-key cryptosystems such as RSA (Rivest, Shamir, and Adleman 1978), ElGamal (1985) and elliptic curve cryptography (ECC) (Koblitz 1987)...

    Chuanpeng Chenet al. Efficient algorithm and systolic architecture for modular division

    • ...ElGamal cryptosystem [11] is the classical example of multiplicatively homomorphic scheme, whereas Paillier’s one [15] is an additively homomorphic encryption scheme...

    Javier Herranz. Restricted adaptive oblivious transfer

Sort by: