Concurrent Blind Signatures without Random Oracles∗ Aggelos Kiayias† Hong-Sheng Zhou† Abstract

First Page		Document Content
Date: 2006-05-20 02:15:48 Blind signature Group signature ElGamal encryption RSA Paillier cryptosystem XTR Diffie–Hellman problem Homomorphic encryption Commitment scheme Cryptography Public-key cryptography Digital signature		Concurrent Blind Signatures without Random Oracles∗ Aggelos Kiayias† Hong-Sheng Zhou† Abstract Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 295,86 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