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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kivinen, T., Kojo, M.: More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE). IETF RFC 3526 (May 2003)
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)
Maurer, U.M.: Fast Generation of Prime Numbers asd Secure Public-Key Cryptographic Parameters. J. Cryptology (1994)
Orman, H.: The Oakley Key Determination Protocol. IETF RFC 2412 (November 1998)
Serre, J.-P.: A course in arithmetic. Springer, New York (1973)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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