<--- Back to Details
First PageDocument Content
Number theory / Integer factorization algorithms / Modular arithmetic / Integer sequences / Public-key cryptography / Very smooth hash / RSA / Quadratic residue / Smooth number / Mathematics / Cryptography / Cryptographic hash functions
Date: 2006-03-08 22:54:11
Number theory
Integer factorization algorithms
Modular arithmetic
Integer sequences
Public-key cryptography
Very smooth hash
RSA
Quadratic residue
Smooth number
Mathematics
Cryptography
Cryptographic hash functions

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 236,05 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