<--- Back to Details
First PageDocument Content
Finite fields / Post-quantum cryptography / McEliece cryptosystem / Error detection and correction / Forward error correction / Key size / XTR / RSA / Quantum computer / Cryptography / Public-key cryptography / Electronic commerce
Date: 2010-05-10 03:44:31
Finite fields
Post-quantum cryptography
McEliece cryptosystem
Error detection and correction
Forward error correction
Key size
XTR
RSA
Quantum computer
Cryptography
Public-key cryptography
Electronic commerce

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 392,83 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