de Meulenaer, Giacomo
[UCL]
Quisquater, Jean-Jacques
[UCL]
Gosset, F.
De Dormale, G. Meurice
Currently, the best known algorithm for factorizing modulus of the RSA public key cryptosystem is the Number Field Sieve. One of its important phases usually combines a sieving technique and a method for checking smoothness of mid-size numbers. For this factorization, the Elliptic Curve Method (ECM) is an attractive solution. As ECM is highly regular and many parallel computations are required, hardware-based platforms were shown to be more cost-effective than software solutions. The few papers dealing with implementation of ECM on FPGA are all based on bit-serial architectures. They use only general-purpose logic and low-cost FPGAs which appear as the best performance/cost solution. This work explores another approach, based on the exploitation of embedded multipliers available in modern FPGAs and the use of high-performances FPGAs. The proposed architecture - based on a fully parallel and pipelined modular multiplier circuit - exhibits a 15-fold improvement over throughput/hardware cost ratio of previously published results.
Bibliographic reference |
de Meulenaer, Giacomo ; Quisquater, Jean-Jacques ; Gosset, F. ; De Dormale, G. Meurice. Integer factorization based on elliptic curve method: towards better exploitation of reconfigurable hardware.15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2007) (Napa, CA, USA, 23-25 April 2007). In: 15th Annual IEEE Symposium on Field-Programmable Custom ComputingMachines (FCCM 2007), IEEE2007, p. 197-206 |
Permanent URL |
http://hdl.handle.net/2078.1/67811 |