Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography

First Page		Document Content
Date: 2008-09-27 14:59:29 Abstract algebra Algebra Mathematics Finite fields Integer factorization algorithms Group theory Elliptic curve cryptography Lenstra elliptic curve factorization Elliptic curves Elliptic curve Torsion Order		Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 349,11 KB Share Document on Facebook

	A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16 DocID: 1xVbz - View Document
	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–412) HEURISTICS FOR THE ARITHMETIC OF ELLIPTIC CURVES Bjorn Poonen DocID: 1xUku - View Document
	A New Family of Pairing-Friendly elliptic curves Michael Scott1 and Aurore Guillevic2 1 2 DocID: 1xTit - View Document
	Ordinary elliptic curves of high rank over Fp (x) with constant j-invariant II Claus Diem and Jasper Scholten July 17, 2006 Abstract DocID: 1vrcn - View Document
	Contemporary Mathematics The geometry of efficient arithmetic on elliptic curves David Kohel Abstract. The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms o DocID: 1vqo7 - View Document