<--- Back to Details
First PageDocument Content
ID-based encryption / Ciphertext indistinguishability / RSA / Semantic security / Cipher / Advanced Encryption Standard / Cryptography / Homomorphic encryption / Verifiable computing
ID-based encryption
Ciphertext indistinguishability
RSA
Semantic security
Cipher
Advanced Encryption Standard
Cryptography
Homomorphic encryption
Verifiable computing

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 302,61 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