Factorization of a 768-bit RSA modulus

Conference object, Other literature type English OPEN
Kleinjung , Thorsten ; Aoki , Kazumaro ; Franke , Jens ; Lenstra , Arjen , ; Thomé , Emmanuel ; Bos , Joppe , ; Gaudry , Pierrick ; Kruppa , Alexander ; Montgomery , Peter , ; Osvik , Dag Arne ; Te Riele , Herman ; Timofeev , Andrey ; Zimmermann , Paul (2010)
  • Publisher: Springer Verlag
  • Related identifiers: doi: 10.1007/978-3-642-14623-7_18
  • Subject: RSA | Linear-Equations | number field sieve | Number-Field Sieve | Block Wiedemann Algorithm | Gf(2) | [ INFO.INFO-CR ] Computer Science [cs]/Cryptography and Security [cs.CR]
    acm: Hardware_ARITHMETICANDLOGICSTRUCTURES

The original publication is available at www.springerlink.com; International audience; This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
  • References (38)
    38 references, page 1 of 4

    1. Adleman, L.M.: Factoring numbers using singular integers. In: STOC, pp. 64-71. ACM, New York (1991)

    2. Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 1-12. Springer, Heidelberg (2007)

    3. Bahr, F.: Liniensieben und Quadratwurzelberechnung für das Zahlkörpersieb, Diplomarbeit, University of Bonn (2005)

    4. Bahr, F., Böhm, M., Franke, J., Kleinjung, T.: Factorization of RSA-200 (May 2005), http://www.loria.fr/~zimmerma/records/rsa200

    5. Buhler, J., Montgomery, P., Robson, R., Ruby, R.: Implementing the number field sieve. Technical report, Oregon State University (1994)

    6. Cavallar, S.: Strategies in filtering in the number field sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 209-232. Springer, Heidelberg (2000)

    7. Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W.M., Montgomery, P.L., Murphy, B., te Riele, H.J.J., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P.C., Marchand, J., Morain, F., Muffett, A., Putnam, C., Putnam, C., Zimmermann, P.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 1-18. Springer, Heidelberg (2000)

    8. Coppersmith, D.: Solving linear equations over GF(2): block Lanczos algorithm. Linear Algebra and its Applications 192, 33-60 (1993)

    9. Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62(205), 333-350 (1994)

    10. Cowie, J., Dodson, B., Elkenbracht-Huizing, R.M., Lenstra, A.K., Montgomery, P.L., Zayer, J.: A world wide number field sieve factoring record: On to 512 bits. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 382-394. Springer, Heidelberg (1996)

  • Metrics
    No metrics available
Share - Bookmark