Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields Jean-Charles Faug`ere1 Ludovic Perret1 Gu´ena¨el Renault1

First Page		Document Content
Date: 2012-04-20 07:14:48 Group theory Cryptography Logarithms Computational hardness assumptions Index calculus algorithm Discrete logarithm Elliptic curve XTR Polynomial Abstract algebra Algebra Finite fields		Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields Jean-Charles Faug`ere1 Ludovic Perret1 Gu´ena¨el Renault1 Add to Reading List Source URL: www.iacr.org Download Document from Source Website File Size: 430,57 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