Cryptography and Computer Security CS255

First Page		Document Content
Date: 2010-02-16 02:29:22 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography		Cryptography and Computer Security CS255 Add to Reading List Source URL: crypto.stanford.edu Download Document from Source Website File Size: 87,45 KB Share Document on Facebook

	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