Skip to main content
SpringerLink
Log in

(Short Paper) Parameter Trade-Offs for NFS and ECM

  • Conference paper
  • First Online:
Advances in Information and Computer Security (IWSEC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11049))

Included in the following conference series:

  • 537 Accesses

Abstract

This paper analyzes two factoring algorithms, NFS (Number Field Sieve) and ECM (Elliptic Curve Method). The previous results only minimize their running times, however, we may need to minimize the storage size or running time with smaller success probability. We provide these trade-offs, L[s] (\(s\le 1/3\)) memory requires \(L[1-2s]\) running time for NFS, for example. This can be interpreted that NFS requires much more running time when reducing memory complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 124–134. IEEE Computer Society (1994)

    Google Scholar 

  2. Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). https://doi.org/10.1007/BFb0091534

    Book  MATH  Google Scholar 

  3. Coppersmith, D.: Modifications to the number field sieve. J. Cryptology 6(3), 169–180 (1993)

    Article  MathSciNet  Google Scholar 

  4. Kleinjung, T.: On polynomial selection for the general number field sieve. Math. Comput. 75(256), 2037–2047 (2006)

    Article  MathSciNet  Google Scholar 

  5. Aoki, K., Ueda, H.: Sieving using bucket sort. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 92–102. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30539-2_8

    Chapter  Google Scholar 

  6. Papadopoulos, J.: A self-tuning filtering implementation for the number field sieve, CADO workshop on integer factorization. http://cado.gforge.inria.fr/workshop/

  7. 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). https://doi.org/10.1007/978-3-540-76900-2_1

    Chapter  Google Scholar 

  8. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables. Applied Mathematics Ser. vol. 55. National Bureau of Standards (1964). Tenth Printing, December 1972, with corrections

    Google Scholar 

  9. Crandall, R., Pomerance, C.: Prime Numbers. A Computational Perspective. Springer, New York (2001). https://doi.org/10.1007/0-387-28979-8

    Book  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  11. Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649–673 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Secure Platform Laboratories, Nippon Telegraph and Telephone Corporation, 3-9-11 Midoricho, Musashino-shi, Tokyo, 180-8585, Japan

    Kazumaro Aoki

Authors
  1. Kazumaro Aoki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kazumaro Aoki .

Editor information

Editors and Affiliations

  1. Tokyo Denki University, Tokyo, Japan

    Atsuo Inomata

  2. Nippon Telegraph and Telephone Corporation, Tokyo, Japan

    Kan Yasuda

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aoki, K. (2018). (Short Paper) Parameter Trade-Offs for NFS and ECM. In: Inomata, A., Yasuda, K. (eds) Advances in Information and Computer Security. IWSEC 2018. Lecture Notes in Computer Science(), vol 11049. Springer, Cham. https://doi.org/10.1007/978-3-319-97916-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-97916-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-97915-1

  • Online ISBN: 978-3-319-97916-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation