Prime numbers of Diffie-Hellman Groups for IKE-MODP
作者： Ikkwon Yie , Seongan Lim , Seungjoo Kim , Dongryeol Kim
DOI: 10.1007/978-3-540-24582-7_17
关键词: Prime number 、 Diffie–Hellman key exchange 、 Prime (order theory) 、 Provable prime 、 Computer science 、 Internet Key Exchange 、 Public-key cryptography 、 Finite field 、 Discrete logarithm 、 Strong prime 、 Arithmetic
摘要: For Discrete Logarithm Problem(DLP) based public key cryptography, the most time consuming task is mathematical operations in underlying finite field. computational efficiency, a predeterminate form of prime p has been proposed to be used Diffie-Hellman Groups for Internet Key Exchange(IKE). In this paper, we analyze effect pre-fixed bits numbers related security and efficiency suggest some alternative choices p’s More Modular Exponential (MODP) groups as substitute Exchange(IKE) which published RFC IETF recently.
springer.com
sci-hub.st 参考文章(7)
Daniel M. Gordon, Designing and Detecting Trapdoors for Discrete Log Cryptosystems international cryptology conference. pp. 66- 75 ,(1992) , 10.1007/3-540-48071-4_5
Jean Pierre Serre, A Course in Arithmetic ,(1973)
T. Kivinen, M. Kojo, More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE) RFC. ,vol. 3526, pp. 1- 10 ,(2003)
Hilarie Orman, The Oakley Key Determination Protocol RFC. ,vol. 2412, pp. 1- 55 ,(1997)
Ueli M. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters Journal of Cryptology. ,vol. 8, pp. 123- 155 ,(1995) , 10.1007/BF00202269
A. K. Lenstra, H. W. Lenstra, M. S. Manasse, J. M. Pollard, The number field sieve symposium on the theory of computing. pp. 564- 572 ,(1990) , 10.1145/100216.100295
J-P. Serre, A Course in Arithmetic Graduate Texts in Mathematics. ,(1973) , 10.1007/978-1-4684-9884-4