<--- Back to Details
First PageDocument Content
Finite fields / Error detection and correction / Hash function / XTR / RSA / MD5 / Prime number / Collision resistance / Cryptography / Search algorithms / Public-key cryptography
Date: 2005-05-19 04:51:22
Finite fields
Error detection and correction
Hash function
XTR
RSA
MD5
Prime number
Collision resistance
Cryptography
Search algorithms
Public-key cryptography

Add to Reading List

Source URL: www.win.tue.nl

Download Document from Source Website

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