Faster index calculus for the medium prime case Application to 1175-bit and 1425-bit finite fields Antoine Joux CryptoExperts and Universit´e de Versailles Saint-Quentin-en-Yvelines, Laboratoire PRISM, ´

First Page		Document Content
Date: 2013-01-07 07:11:10 Orthogonal polynomials Polynomials Integer factorization algorithms Finite field General number field sieve Logarithm Special functions Mathematics Abstract algebra		Faster index calculus for the medium prime case Application to 1175-bit and 1425-bit finite fields Antoine Joux CryptoExperts and Universit´e de Versailles Saint-Quentin-en-Yvelines, Laboratoire PRISM, ´ Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 277,27 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
	Module 3.9 Page 504 ofModule 3.9: What is a Logarithm? DocID: 1v5ns - 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