Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography Alfred Menezes1 , Palash Sarkar2 , and Shashank Singh3 1 Department of Combinatorics - Modular Neutron Array - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-12-27 11:29:50 Algebra Mathematics Polynomials Computer algebra Integer factorization algorithms Finite fields Special number field sieve General number field sieve Irreducible polynomial Discrete logarithm Factorization Resultant		Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography Alfred Menezes1 , Palash Sarkar2 , and Shashank Singh3 1 Department of Combinatorics & Optimization, University of Water Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 355,70 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