Date: 2005-03-13 11:15:51Cryptography Integer factorization algorithms Lenstra elliptic-curve factorization Quadratic sieve Elliptic-curve cryptography Elliptic curve Integer factorization General number field sieve RSA Trial division | | 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 StahAdd to Reading ListSource URL: www.hyperelliptic.orgDownload Document from Source Website File Size: 230,15 KBShare Document on Facebook
|