CalculemusThe 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning Calculemus 2009 Emerging Trends

First Page		Document Content
Date: 2009-08-28 11:37:21 Theoretical computer science Algorithm Correctness RSA Metamath Symbolic computation Recursion		CalculemusThe 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning Calculemus 2009 Emerging Trends Add to Reading List Source URL: www.calculemus.net Download Document from Source Website File Size: 667,27 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