<--- Back to Details
First PageDocument Content
Homomorphic encryption / Malleability / Blind signature / RSA / Semantic security / Digital signature / Damgård–Jurik cryptosystem / Benaloh cryptosystem / Cryptography / Public-key cryptography / Paillier cryptosystem
Date: 2002-11-19 09:06:37
Homomorphic encryption
Malleability
Blind signature
RSA
Semantic security
Digital signature
Damgård–Jurik cryptosystem
Benaloh cryptosystem
Cryptography
Public-key cryptography
Paillier cryptosystem

Add to Reading List

Source URL: web.mit.edu

Download Document from Source Website

File Size: 190,37 KB

Share Document on Facebook

Similar Documents

Cryptography / Mathematics / Algebra / Finite fields / Computational hardness assumptions / Integer factorization algorithms / Emerging technologies / Quantum computing / RSA / Euclidean algorithm / Quantum algorithm / XTR

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