- Published 2005

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). One important step within the GNFS is the factorization of midsize numbers for smoothness testing, an efficient algorithm for which is the Elliptic Curve Method (ECM). We present an efficient hardware implementation of ECM to factor numbers up to 200 bits, which is also scalable to other bit lengths.

@inproceedings{Drutarovsk2005FpgaIO,
title={Fpga Implementation of Elliptic Curve Method for Factorization},
author={Milos Drutarovsk{\'y}},
year={2005}
}