<--- Back to Details
First PageDocument Content
Algebraic structures / Field theory / Commitment scheme / Public-key cryptography / Ring / RSA / Field / Finite field / Modulo operation / Cryptography / Abstract algebra / Mathematics
Date: 2004-09-14 08:16:49
Algebraic structures
Field theory
Commitment scheme
Public-key cryptography
Ring
RSA
Field
Finite field
Modulo operation
Cryptography
Abstract algebra
Mathematics

Microsoft PowerPoint - commit.ppt

Add to Reading List

Source URL: www.cs.purdue.edu

Download Document from Source Website

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