Nothing Special   »   [go: up one dir, main page]

Skip to main content

Prime Numbers of Diffie-Hellman Groups for IKE-MODP

  • Conference paper
Progress in Cryptology - INDOCRYPT 2003 (INDOCRYPT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2904))

Included in the following conference series:

  • 860 Accesses

Abstract

For Discrete Logarithm Problem(DLP) based public key cryptography, the most time consuming task is the mathematical operations in the underlying finite field. For computational efficiency, a predeterminate form of prime p has been proposed to be used in Diffie-Hellman Groups for Internet Key Exchange(IKE). In this paper, we analyze the effect of pre-fixed bits of the prime numbers related to the security and efficiency and we suggest some alternative choices for prime p’s for More Modular Exponential (MODP) Diffie-Hellman groups as a substitute for Internet Key Exchange(IKE) which has been published as RFC of IETF recently.

Yie’s work was supported by Inha Research Fund.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kivinen, T., Kojo, M.: More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE). IETF RFC 3526 (May 2003)

    Google Scholar 

  2. Gordon, D.M.: Designing and Detecting Trapdoors for Discrete Log Cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 66–75. Springer, Heidelberg (1993)

    Google Scholar 

  3. Maurer, U.M.: Fast Generation of Prime Numbers asd Secure Public-Key Cryptographic Parameters. J. Cryptology (1994)

    Google Scholar 

  4. Orman, H.: The Oakley Key Determination Protocol. IETF RFC 2412 (November 1998)

    Google Scholar 

  5. Serre, J.-P.: A course in arithmetic. Springer, New York (1973)

    MATH  Google Scholar 

  6. Lenstra, A.K., Lenstra, H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: The developement of number field sieve. Lecture Notes in Mathematics, vol. 1554, Springer, Heidelberg (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yie, I., Lim, S., Kim, S., Kim, D. (2003). Prime Numbers of Diffie-Hellman Groups for IKE-MODP. In: Johansson, T., Maitra, S. (eds) Progress in Cryptology - INDOCRYPT 2003. INDOCRYPT 2003. Lecture Notes in Computer Science, vol 2904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24582-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24582-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20609-5

  • Online ISBN: 978-3-540-24582-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics