Abelian Varieties and Pairing-Based Cryptography Theoretical foundations Practical results Pairing-friendly Hyperelliptic Curves and Weil Restriction

First Page		Document Content
Date: 2009-09-23 22:25:58 Cryptography Algebraic curves Elliptic curves Algebraic surfaces Abelian varieties Weil pairing Pairing Tate pairing Hyperelliptic curve Abstract algebra Algebraic geometry Geometry		Abelian Varieties and Pairing-Based Cryptography Theoretical foundations Practical results Pairing-friendly Hyperelliptic Curves and Weil Restriction Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 274,10 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
	An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method Jens Franke, Thorsten Kleinjung - University of Bonn Christof Paar, Jan Pelzl - University of Bochum Christine Priplata, Colin Stah DocID: 1xTCa - View Document