The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania

First Page		Document Content
Date: 2018-10-05 10:39:17 Abstract algebra Algebra Cryptography Group theory Finite fields Logarithms Elliptic curve cryptography Public-key cryptography Index calculus algorithm Elliptic-curve cryptography Discrete logarithm Random walk		The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 265,05 KB Share Document on Facebook

	A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany DocID: 1qKpq - View Document
	On the Function Field Sieve and the Impact of Higher Splitting Probabilities Robert Granger Joint work with Faruk Gölo§lu, Gary McGuire and Jens Zumbrägel DocID: 1qJsF - View Document
	Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 DocID: 1qjra - View Document
	Master’s thesis in Mathematics The use of elliptic curves in cryptography by Gijsbert van Vliet DocID: 1pH9i - View Document
	Public Key Cryptography Using Discrete Logarithms in Finite Fields: Algorithms, Efficient Implementation and Attacks L. Maurits) DocID: 1obzi - View Document