<--- Back to Details
First PageDocument Content
Computer arithmetic / Exponentials / Binary operations / Multiplication / Montgomery reduction / Modular exponentiation / Exponentiation by squaring / Multiplication algorithm / RSA / Mathematics / Abstract algebra / Modular arithmetic
Date: 2009-10-19 11:54:30
Computer arithmetic
Exponentials
Binary operations
Multiplication
Montgomery reduction
Modular exponentiation
Exponentiation by squaring
Multiplication algorithm
RSA
Mathematics
Abstract algebra
Modular arithmetic

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

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