An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method Jens Franke1 , Thorsten Kleinjung1 , Christof Paar2 , Jan Pelzl2 , 4 ˇ Christine Priplata3 , Martin Simka

First Page		Document Content
Date: 2005-03-13 11:15:55 Integer factorization algorithms Mathematics Abstract algebra Algebra Lenstra elliptic-curve factorization Quadratic sieve Montgomery modular multiplication Elliptic curve Exceptional case-marking Division algorithm General number field sieve		An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method Jens Franke1 , Thorsten Kleinjung1 , Christof Paar2 , Jan Pelzl2 , 4 ˇ Christine Priplata3 , Martin Simka Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 231,19 KB Share Document on Facebook

	Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbrenner, Hoang Le, Mohammed Khaleeluddin, Ramakrishna Bachimanchi George Mason University {kg DocID: 1xVNI - View Document
	Hardware for Collision Search on Elliptic Curve over GF(2m) Philippe Bulens∗, Guerric Meurice de Dormale† and Jean-Jacques Quisquater UCL Crypto Group Universit´e Catholique de Louvain DocID: 1xVem - View Document
	On the Security of Elliptic Curve Cryptosystems against Attacks with Special-Purpose Hardware Tim G¨ uneysu, Christof Paar, Jan Pelzl Horst G¨ortz Institute for IT Security, Ruhr University Bochum, Germany {gueneysu,cp DocID: 1xUIc - View Document
	Hardware for Collision Search m on Elliptic Curve over GF(2 ) Philippe Bulens (S), Guerric Meurice de Dormale and Jean-Jacques Quisquater {bulens, gmeurice, quisquater}@dice.ucl.ac.be DocID: 1xUdt - View Document