Hardware factorization based on elliptic curve method

Proceedings - 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2005

Volumn 2005, Issue , 2005, Pages 107-116

  Šimka, Martin ^a   Pelzl, Jan ^b   Kleinjung, Thorsten ^c   Franke, Jens ^c   Priplata, Christine ^d   Stahlke, Colin ^d   Drutarovský, Miloš ^a   Fischer, Viktor ^e   Paar, Christof ^b  

^a TECHNICAL UNIVERSITY OF KO ICE   (Slovakia)

^b RUHR UNIVERSITY BOCHUM   (Germany)

^c UNIVERSITY OF BONN   (Germany)

^d EDIZONE GmbH   (Germany)

^e UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; INTEGER PROGRAMMING; SEARCH ENGINES;

ECM HARDWARE ENGINES; ELLIPTIC CURVE METHOD; HARDWARE FACTORIZATION;

CRYPTOGRAPHY;

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

References (15)

1. ARM Limited. ARM7TDMI (Rev 3) - Technical Reference Manual, http://www.arm.com/pdfs/DDI0029G_7TDMI_R3_trm.pdf, 2001.
2. R. P. Brent. Some Integer Factorization Algorithms Using Elliptic Curves. In Australian Computer Science Communications 8, pages 149-163, 1986.
3. M. Drutarovský, V. Fischer, and M. Šimka. Comparison of two implementations of scalable Montgomery coprocessor embedded in reconfigurable hardware. In Proceedings of the XIX Conference on Design of Circuits and Integrated Systems - DC/5 2004, pages 240-245, Bordeaux, France, Nov. 24-26, 2004.
4. J. Franke, T. Kleinjung, F. Bahr, M. Lochter, and M. Bohm. E-mail announcement. http://www.crypto-world.com/announcements/rsa576. txt, Dec. 2003.
5. J. Franke, T. Kleinjung, C. Paar, J. Pelzl, C. Priplata, and C. Stahlke. SHARK - A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers. In 1st Workshop on Special-purpose Hardware for Attacking Cryptographic Systems - SHARCS 2005, Paris, France, Feb. 24-25, 2005.
6. N. Gura, S. Chang, H. 2, G. Sumit, V. Gupta, D. Finchelstein, E. Goupy, and D. Stebila. An End-to-End Systems Approach to Elliptic Curve Cryptography. In Ç. K. Koç and C. Paar, editors. Cryptographic Hardware and Embedded Systems - CHES 2002, volume LNCS 2523, pages 349-365. Springer-Verlag, 2002.
7. A. K. Lenstra and H. W. Lenstra. The Development of the Number Field Sieve. Lecture Notes in Math. Volume 1554. 1993.
8. H. W. Lenstra. Factoring Integers with Elliptic Curves. Annals of Mathematics, 126(2):649-673, 1987.
9. P. Montgomery. Speeding up the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48:243-264, 1987.
10. G. Orlando and C. Paar. A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware. In Ç. K. Koç, D. Naccache, and C. Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems - CHES 2001, volume LNCS 2162, pages 348-363. Springer-Verlag, May 14-16, 2001.
11. J. Pollard. A Monte Carlo Method for Factorization. Nordisk Tidskrift for Informationsbehandlung (BIT), 15:331-334, 1975.
12. A. Shamir and E. Tromer. Factoring Large Numbers with the TWIRL Device. In Advances in Cryptology - Crypto 2003, volume 2729 of LNCS, pages 1-26. Springer, 2003.
13. A. Tenca and Ç.K. Koç. A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm. IEEE Trans. Comput., 52(9): 1215-1221, 2003.
14. C. D. Walter. Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. In B. Preneel, editor, Proceedings of Topics in Cryptology- CT-RSA 2002, volume 2271 of Lecture Notes in Computer Science, pages 30-39, 2002.
15. Xilinx. Virtex-E 1.8V Field Programmable Gate Arrays - Production Product Specification, http://www.xilinx.com/bvdocs/publications/ds022.pdf, June 2004.