CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

First Page		Document Content
Date: 2003-01-05 20:38:47 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields		CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Download Document from Source Website File Size: 41,78 KB Share Document on Facebook

	On the discrete logarithm problem for plane curves Claus Diem October 26, 2012 Abstract DocID: 1vhrJ - View Document
	Errata After now a year has passed since I submitted my Habilitation thesis “On arithmetic and the discrete logarithm problem in class groups of curves”, I realized some mistakes and inaccuracies. Two of the mistake DocID: 1v8oL - View Document
	On the discrete logarithm problem in elliptic curves Claus Diem August 9, 2010 Dedicated to Gerhard Frey DocID: 1v15F - View Document
	Systems of polynomial equations associated to elliptic curve discrete logarithm problems Claus Diem Institute for Experimental Mathematics, University of Duisburg-Essen October 27, 2004 DocID: 1uWKu - View Document
	The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences Kristin E. Lauter1 and Katherine E. Stange2,? 1 DocID: 1uE9P - View Document