Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8781, Issue , 2014, Pages 363-379

  Wenger, Erich ^a   Wolfger, Paul ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Discrete logarithm problem; Discrete logarithm record; Elliptic curve cryptography; FPGA; Hardware design; Koblitz curve

Indexed keywords

FIELD PROGRAMMABLE GATE ARRAYS (FPGA); ITERATIVE METHODS; PUBLIC KEY CRYPTOGRAPHY;

DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; ELLIPTIC CURVE CRYPTOGRAPHY; HARDWARE DESIGN; KOBLITZ CURVES;

GEOMETRY;

EID: 84918594455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-13051-4_22     Document Type: Conference Paper

References (31)

1. Avnet Inc, Feb 2014. http://www.avnet.com??
2. SciEngines GmbH, Feb 2014. http://www.sciengines.com??
3. Babbage, S., Catalano, D., Cid, C., de Weger, B., Dunkelman, O., Gehrmann, C., Granboulan, L., Güneysu, T., Hermans, J., Lange, T., Lenstra, A., Mitchell, C., Näslund, M., Nguyen, P., Paar, C., Paterson, K., Pelzl, J., Pornin, T., Preneel, B., Rechberger, C., Rijmen, V., Robshaw, M., Rupp, A., Schläffer, M., Vaudenay, S., Vercauteren, F., Ward M.: ECRYPT II yearly report on algorithms and keysizes (2011-2012). http://www.ecrypt.eu.org?? Sep 2012
4. Bailey, D.V., Baldwin, B., Batina, L., Bernstein, D.J., Birkner, P., Bos, J.W., van Damme, G., de Meulenaer, G., Fan, J., Güneysu, T., Gurkaynak, F., Kleinjung, T., Lange, T., Mentens, N., Paar, C., Regazzoni, F., Schwabe, P., Uhsadel, L.: The certicom challenges ECC2-X. IACR cryptology ePrint archive, Report 2009/466 (2009)
5. Bailey, D.V., Batina, L., Bernstein, D.J., Birkner, P., Bos, J.W., Chen, H.-C., Cheng, C.-M., van Damme, G., de Meulenaer, G., Perez, L.J.D., Fan, J., Güneysu, T., Gurkaynak, F., Kleinjung, T., Lange, T., Mentens, N., Niederhagen, R., Paar, C., Regazzoni, F., Schwabe, P., Uhsadel, L., Herrewege, A.V., Yang B.-Y.: Breaking ECC2K-130. IACR cryptology ePrint archive, Report 2009/541 (2009)
6. Barker, E., Roginsky, A.: Recommendation for cryptographic key generation. NIST Spec. Publ. 800, 133 (2012)
7. Bernstein, D.J.: Batch binary edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 317-336. Springer, Heidelberg (2009)
8. Bernstein, D.J.: Binary Batch Edwards 113-bit Multiplier (May 2009). http:/?binary.cr.yp.to/bbe251/113.gz
9. Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Crypt. 2(3), 212 (2012)
10. Certicom Research: The Certicom ECC Challenge (Nov 1997). https://www.certicom.com/index.php/the-certicom-ecc-challenge
11. Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography: Discrete Mathematics and its Applications. Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall/CRC, Boca Raton (2006)
12. Fan, J., Bailey, D.V., Batina, L., Güneysu, T., Paar, C., Verbauwhede, I.: Breaking elliptic curve cryptosystems using reconfigurable hardware. In: Field Programmable Logic and Applications (FPL), pp. 133-138. IEEE (2010)
13. Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62(206), 865-874 (1994)
14. Gallant, R., Lambert, R., Vanstone, S.: Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comput. Am. Math. Soc. 69(232), 1699-1705 (2000)
15. Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of weil descent on elliptic curves. J. Cryptol. 15(1), 19-46 (2002)
16. Güneysu, T., Paar, C., Pelzl, J.: Attacking elliptic curve cryptosystems with special-purpose hardware. In: FPGA, pp. 207. ACM Press (2007)
17. Hankerson, D., Vanstone, S., Menezes, A.J.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)
18. Harley, R.: Elliptic curve discrete logarithms: ECC2K-108 (2000). http://cristal.inria.fr/harley/ecdl7/readMe.html
19. Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Inf. Comput. 78(3), 171-177 (1988)
20. Judge, L., Schaumont, P.: A flexible hardware ECDLP engine in bluespec. In: Special-Purpose Hardware for Attacking Cryptographic Systems (SHARCS) (2012)
21. Mane, S., Judge, L., Schaumont, P.: An integrated prime-field ECDLP hardware accelerator with high-performance modular arithmetic units. In: Reconfigurable Computing and FPGAs, pp. 198-203. IEEE, Nov. 2011
22. Mastrovito, E.D.: VLSI designs for multiplication over finite fields GF(2m), pp. 297-309. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (1988)
23. Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. Trans. Inf. Theory 39(5), 1639-1646 (1993)
24. Meurice de Dormale, G., Bulens, P., Quisquater, J.-J.: Collision search for elliptic curve discrete logarithm over GF(2m) with FPGA. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 378-393. Springer, Heidelberg (2007)
25. Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. Trans. Inf. Theory 24(1), 106-110 (1978)
26. Pollard, J.M.: A monte carlo method for factorization. BIT Numer. Math. 15(3), 331-334 (1975)
27. Rodrıguez-Henrıquez, F., Koç, Ç .: On fully parallel karatsuba multipliers for GF(2m), pp. 405-410. In Computer Science and Technology (2003)
28. Stier, C.: Students break record by folding toilet paper 13 times. http://www.newscientist.com/blogs/nstv/2012/01/paper-folding-limits-pushed.html. Jan 2012
29. Teske, E.: Speeding up pollard’s rho method for computing discrete logarithms. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 541-554. Springer, Heidelberg (1998)
30. van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1-28 (1999)
31. Wiener, M., Zuccherato, R.J.: Faster attacks on elliptic curve cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 190-200. Springer, Heidelberg (1999)