Hardware Factorization Based on Elliptic Curve Method - Université Jean-Monnet-Saint-Étienne Access content directly
Conference Papers Year : 2005

Hardware Factorization Based on Elliptic Curve Method


The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is the General Number Field Sieve (GNFS). Recently, architectures for special purpose hardware for the GNFS have been proposed [5, 12]. One important step within the GNFS is the factorization of mid-size numbers for smoothness testing, an efficient algorithm for which is the Elliptic Curve Method (ECM). Since the smoothness testing is also suitable for parallelization, it is promising to improve ECM via special-purpose hardware. We show that massive parallel and cost efficient ECM hardware engines can improve the cost-time product of the RSA moduli factorization via the GNFS considerably. The computation of ECM is a classical example for an algorithm that can be significantly accelerated through special-purpose hardware. In this work, we present an efficient hardware implementation of ECM to factor numbers up to 200 bits, which is also scalable to other bit lengths. For proof-of-concept purposes, ECM is realized as a software-hardware co-design on an FPGA and an embedded microcontroller. This appears to be the first publication of a realized hardware implementation of ECM, and the first description of GNFS acceleration through hardware-based ECM.
No file

Dates and versions

ujm-00307732 , version 1 (29-07-2008)


  • HAL Id : ujm-00307732 , version 1


Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens Franke, Christine Priplata, et al.. Hardware Factorization Based on Elliptic Curve Method. IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05), Apr 2005, Napa, United States. pp.107-116. ⟨ujm-00307732⟩
77 View
0 Download


Gmail Mastodon Facebook X LinkedIn More