Integer factorization based on elliptic curve method: Towards better exploitation of reconfigurable hardware

Proceedings 2007 IEEE Symposium on Field-Programme Custom Computing Machines, FCCM 2007

Volumn , Issue , 2007, Pages 197-206

  De Meulenaer, Giacomo ^a   Gosset, François ^a   De Dormale, Guerric Meurice ^a   Quisquater, Jean Jacques ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Elliptic curve; Factorization; FPGA; Parallel modular multiplier

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE; COST EFFECTIVENESS; FACTORIZATION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); GEOMETRY; PUBLIC KEY CRYPTOGRAPHY;

ATTRACTIVE SOLUTIONS; BEST-KNOWN ALGORITHMS; BIT-SERIAL ARCHITECTURE; ELLIPTIC CURVE; INTEGER FACTORIZATION; MODULAR MULTIPLIERS; PROPOSED ARCHITECTURES; RSA PUBLIC-KEY CRYPTOSYSTEM;

RECONFIGURABLE HARDWARE;

EID: 47349131737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2007.12     Document Type: Conference Paper

References (20)

1. I.F. Blake, G. Seroussi, N.P Smart, Elliptic Curves in Cryptography, London Mathematical Society, LNS 265, Cambridge University Press, 1999.
2. R. Brent, Recent Progress and Prospects for Integer Factorisation Algorithms, COCOON'00, LNCS 1858, Springer-Verlag, pp. 3-22, 2000.
3. J. Franke, T. Kleinjung, C. Paar, J. Pelzl, C. Priplata, C. Stahlke, SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers, CHES'05, LNCS 3659, Springer, pp. 119-130, 2005.
4. K. Gaj, S. Kwon, P. Baier, P. Kohlbrenner, H. Le, M. Khaleeluddin, R. Bachimanchi, Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware, CHES'06, LNCS 4249, Springer, pp. 119-133, 2006.
5. W. Geiselmann, F. Januszewski, H. K opfer, J. Pelzl, R. Steinwandt, A Simpler Sieving Device: Combining ECM and TWIRL, ICISC'06, LNCS, Springer, 2006.
6. W. Geiselmann, A. Shamir, R. Steinwandt, E. Tromer, Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization, CHES'05, LNCS 3659, Springer, pp. 131-146, 2005.
7. L. Hars, Long Modular Multiplication for Cryptographic Applications, CHES'04, LNCS 3156, pp. 44-61, 2004.
8. T. Kleinjung, Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers, SHARCS'06, pp. 159-168, 2006.
9. H. Lenstra, Factoring integers with elliptic curves, Annals of Mathematics, Vol. 126, pp. 649- 673, 1987.
10. A.K. Lenstra, H.W. Lenstra, The Development of the Number Field Sieve, Lecture Note in Math., Vol. 1554, Springer-Verlag, 1993.
11. P. Montgomery, Modular Multiplication without Trial Division, Mathematics of Computation, No. 44(170), pp. 519-521, 1985.
12. P. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, 48(177), pp. 243-264, 1987.
13. H. Orup, Simplifying Quotient Determination in High-Radix Modular Multiplication, ARITH-12, IEEE, pp. 193-199, 1995.
14. J. Pelzl, M. Šimka, T. Kleinjung, J. Franke, C. Priplata, C. Stahlke, M. Drutarovsky, V. Fisher, C. Paar, Area-time efficient hardware architecture for factoring integers with the elliptic curve method, IEE Proceedings on Information Security, Vol. 152, No. 1, pp. 67-78, 2005.
15. C. Pomerance, A tale of Two Sieves, Notices of the AMS, pp. 1473-1485, 1996.
16. R.L. Rivest, A. Shamir, L.M. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol. 21, No. 2, pp. 120-126, 1978.
17. SHARCS'05, Workshop on Special Purpose Hardware for Attacking Cryptographic Systems, Paris, 2005.
18. S.H. Tang, K.S. Tsui, P.H.W. Leong, Modular exponentiation using parallel multipliers, FPT'03, IEEE, pp. 52-59, 2004.
19. C.D. Walter, Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli, CTRSA' 02, LNCS 2271, pp. 30-39, Springer, 2002.
20. P. Zimmermann, B. Dodson, 20 years of ECM, ANTS VII, LNCS 4076, Springer, pp. 525-542, 2006.