LNCS[removed]Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA

First Page		Document Content
Date: 2006-03-02 14:49:50 Blind signature Electronic voting Dining cryptographers problem David Chaum RSA XTR Cryptography Financial cryptography Public-key cryptography		LNCS[removed]Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA Add to Reading List Source URL: www.cs.elte.hu Download Document from Source Website File Size: 348,03 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