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 Numbers of Diffie-Hellman Groups for IKE-MODP

Ikkwon Yie, Seongan Lim, Seungjoo Kim, Dongryeol Kim

Research output: Chapter in Book/Report/Conference proceeding › Chapter

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Thomas Johansson, Subhamoy Maitra
Publisher	Springer Verlag
Pages	228-234
Number of pages	7
ISBN (Print)	3540206094, 9783540206095
DOIs	https://doi.org/10.1007/978-3-540-24582-7_17
Publication status	Published - 2003
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2904
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

IKE
Prime numbers

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-24582-7_17

Cite this

Yie, I., Lim, S., Kim, S., & Kim, D. (2003). Prime Numbers of Diffie-Hellman Groups for IKE-MODP. In T. Johansson, & S. Maitra (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 228-234). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2904). Springer Verlag. https://doi.org/10.1007/978-3-540-24582-7_17

Prime Numbers of Diffie-Hellman Groups for IKE-MODP. / Yie, Ikkwon; Lim, Seongan; Kim, Seungjoo et al.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Thomas Johansson; Subhamoy Maitra. Springer Verlag, 2003. p. 228-234 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2904).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Yie, I, Lim, S, Kim, S & Kim, D 2003, Prime Numbers of Diffie-Hellman Groups for IKE-MODP. in T Johansson & S Maitra (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2904, Springer Verlag, pp. 228-234. https://doi.org/10.1007/978-3-540-24582-7_17

Yie I, Lim S, Kim S, Kim D. Prime Numbers of Diffie-Hellman Groups for IKE-MODP. In Johansson T, Maitra S, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 228-234. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24582-7_17

Yie, Ikkwon ; Lim, Seongan ; Kim, Seungjoo et al. / 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). editor / Thomas Johansson ; Subhamoy Maitra. Springer Verlag, 2003. pp. 228-234 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{0cb03f313b5942e5ab90e397b43e60c7,

title = "Prime Numbers of Diffie-Hellman Groups for IKE-MODP",

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.",

keywords = "IKE, Prime numbers",

author = "Ikkwon Yie and Seongan Lim and Seungjoo Kim and Dongryeol Kim",

year = "2003",

doi = "10.1007/978-3-540-24582-7_17",

language = "English",

isbn = "3540206094",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "228--234",

editor = "Thomas Johansson and Subhamoy Maitra",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - Prime Numbers of Diffie-Hellman Groups for IKE-MODP

AU - Yie, Ikkwon

AU - Lim, Seongan

AU - Kim, Seungjoo

AU - Kim, Dongryeol

PY - 2003

Y1 - 2003

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

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

KW - IKE

KW - Prime numbers

UR - http://www.scopus.com/inward/record.url?scp=0347526091&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-24582-7_17

DO - 10.1007/978-3-540-24582-7_17

M3 - Chapter

AN - SCOPUS:0347526091

SN - 3540206094

SN - 9783540206095

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 228

EP - 234

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Johansson, Thomas

A2 - Maitra, Subhamoy

PB - Springer Verlag

ER -

Prime Numbers of Diffie-Hellman Groups for IKE-MODP

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this