Offline Submission with RSA Time-Lock Puzzles Yves Igor Jerschow Martin Mauve

First Page		Document Content
Date: 2014-01-09 02:12:40 Public-key cryptography Modular arithmetic Computer arithmetic Electronic commerce RSA Modular exponentiation Montgomery reduction Exponentiation by squaring Eternity II puzzle Cryptography Mathematics Abstract algebra		Offline Submission with RSA Time-Lock Puzzles Yves Igor Jerschow Martin Mauve Add to Reading List Source URL: wwwcn.cs.uni-duesseldorf.de Download Document from Source Website File Size: 282,44 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