More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE)
The DOI matches its Crossref record.
Abstract
This document defines new Modular Exponential (MODP) Groups for the Internet Key Exchange (IKE) protocol.It documents the well known and used 1536 bit group 5, and also defines new 2048, 3072, 4096, 6144, and 8192 bit Diffie-Hellman groups numbered starting at 14.The selection of the primes for theses groups follows the criteria established by Richard Schroeppel.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Internet Key Exchange (IKEv2) Protocol
(2005) · doi:10.17487/rfc4306 · Cited by 683
Mutual Authentication in IoT Systems Using Physical Unclonable Functions
Aman, M. N., Chua, K. C., & Sikdar, B. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2703088 · Cited by 316
The Secure Shell (SSH) Transport Layer Protocol
Ylonen, T. (2006) · doi:10.17487/rfc4253 · Cited by 292
A Privacy-Preserving and Scalable Authentication Protocol for the Internet of Vehicles
Aman, M. N., Javaid, U., & Sikdar, B. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3010893 · Cited by 177
“If we represent the complexity of general modular multiplication with l bit operands by M ( l ) , then the complexity of modular exponentiation is given by O ( M ( l ) k ) , where k is the exponent and M ( l ) is generally quadratic in l [53].”
Background
Metadata
- Authors
- Kivinen, T., & Kojo, M.
- Publisher
- RFC Editor
- Published
- 2003-05
- OpenAlex
- W1656266873
- Cited by
- 101
- References
- 0
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE). https://app.cochat.ai/papers/10.17487/rfc3526
- The paper
- Kivinen, T., & Kojo, M. (2003). More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE). https://doi.org/10.17487/rfc3526
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.