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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Yie, I., Lim, S., Kim, S., & Kim, D. (2003). Prime Numbers of Diffie-Hellman Groups for IKE-MODP. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2904, 228–234. https://doi.org/10.1007/978-3-540-24582-7_17
Mendeley helps you to discover research relevant for your work.