<--- Back to Details
First PageDocument Content
Finite fields / Electronic commerce / Paillier cryptosystem / Okamoto–Uchiyama cryptosystem / Goldwasser–Micali cryptosystem / XTR / ElGamal encryption / Diffie–Hellman problem / RSA / Cryptography / Public-key cryptography / Computational hardness assumptions
Date: 2008-09-15 00:54:54
Finite fields
Electronic commerce
Paillier cryptosystem
Okamoto–Uchiyama cryptosystem
Goldwasser–Micali cryptosystem
XTR
ElGamal encryption
Diffie–Hellman problem
RSA
Cryptography
Public-key cryptography
Computational hardness assumptions

A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications Emmanuel Bresson1 , Dario Catalano2 , and David Pointcheval2 1

Add to Reading List

Source URL: www.iacr.org

Download Document from Source Website

File Size: 240,57 KB

Share Document on Facebook

Similar Documents

Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer ​N​, which we’ll assume for simplicity is a product of two primes |​and , this algorithm lets

Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer ​N​, which we’ll assume for simplicity is a product of two primes |​and , this algorithm lets

DocID: 1xVSj - View Document

PDF Document

DocID: 1xRwQ - View Document

PDF Document

DocID: 1xu6k - View Document

PDF Document

DocID: 1x9q3 - View Document

PDF Document

DocID: 1x1dn - View Document