![Finite fields / Computational complexity theory / Diffie–Hellman problem / ElGamal encryption / Universal hashing / Paillier cryptosystem / Diffie–Hellman key exchange / Cramer–Shoup cryptosystem / Index of cryptography articles / Cryptography / Cryptographic protocols / Public-key cryptography Finite fields / Computational complexity theory / Diffie–Hellman problem / ElGamal encryption / Universal hashing / Paillier cryptosystem / Diffie–Hellman key exchange / Cramer–Shoup cryptosystem / Index of cryptography articles / Cryptography / Cryptographic protocols / Public-key cryptography](https://www.pdfsearch.io/img/bee2c7327cc1fe2f5bb9dbfabeb7db67.jpg) Date: 2005-03-17 15:37:01Finite fields Computational complexity theory Diffie–Hellman problem ElGamal encryption Universal hashing Paillier cryptosystem Diffie–Hellman key exchange Cramer–Shoup cryptosystem Index of cryptography articles Cryptography Cryptographic protocols Public-key cryptography | | A new security proof for Damg˚ ard’s ElGamal Kristian Gjøsteen March 17, 2005 AbstractAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 127,30 KBShare Document on Facebook
|