Sciweavers

202 search results - page 1 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
13 years 10 months ago
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 ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
CHES
2006
Springer
125views Cryptology» more  CHES 2006»
13 years 8 months ago
Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware
A novel portable hardware architecture of the Elliptic Curve Method of factoring, designed and optimized for application in the relation collection step of the Number Field Sieve,...
Kris Gaj, Soonhak Kwon, Patrick Baier, Paul Kohlbr...
MOC
2010
12 years 11 months ago
Factorization with genus 2 curves
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower...
Romain Cosset
AICCSA
2006
IEEE
142views Hardware» more  AICCSA 2006»
13 years 10 months ago
Pipelining GF(P) Elliptic Curve Cryptography Computation
This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and seri...
Adnan Abdul-Aziz Gutub, Mohammad K. Ibrahim, Ahmad...