The DOI matches its Crossref record; 17 of the 22 references it cites were found in a registry or an index.
Additional Diffie-Hellman Groups for Use with IETF Standards
Open accessAbstract
This memo provides information for the Internet community.It
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, for the RFC 5114 groups 22, 23, and 24, the probability that the output of KDF is bigger than p is high [49].”
From Dragonblood: Analyzing the Dragonfly Handshake of WPA3 and EAP-pwd (2020) · cites this paper as [49]
Citations
Cites
Key words for use in RFCs to Indicate Requirement Levels
Bradner, S. O. (1997) · doi:10.17487/rfc2119 · Cited by 3,309
The Transport Layer Security (TLS) Protocol Version 1.1
Dierks, T., & Rescorla, E. K. (2006) · doi:10.17487/rfc4346 · Cited by 2,309
The Internet Key Exchange (IKE)
Harkins, D., & Carrel, D. (1998) · doi:10.17487/rfc2409 · Cited by 1,030
Internet Key Exchange (IKEv2) Protocol
Kaufman, C. (2005) · doi:10.17487/rfc4306 · Cited by 693
Recommendation for key management, part 1 :
Barker, E. B., Barker, W. C., Burr, W. E., Polk, W. T., & Smid, M. E. (2007) · doi:10.6028/nist.sp.800-57p1r2007 · Cited by 461
The Secure Shell (SSH) Transport Layer Protocol
Ylönen, T. (2006) · doi:10.17487/rfc4253 · Cited by 318
Diffie-Hellman Key Agreement Method
Rescorla, E. K. (1999) · doi:10.17487/rfc2631 · Cited by 298
Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS)
Blake-Wilson⋆⋆, S., Bolyard, N., Gupta, V., Hawk, C., & Moeller, B. (2006) · doi:10.17487/rfc4492 · Cited by 169
More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE)
Kivinen, T., & Kojo, M. (2003) · doi:10.17487/rfc3526 · Cited by 111
Recommendation for pair-wise key establishment schemes using discrete logarithm cryptography
Barker, E. B., Chen, L., Regenscheid, A., & Smid, M. E. (2009) · doi:10.6028/nist.sp.800-56b · Cited by 92
Cryptographic Message Syntax (CMS)
Housley, R. (2002) · doi:10.17487/rfc3369 · Cited by 81
Recommendation for pair-wise key establishment schemes using discrete logarithm cryptography
Barker, E. B., Johnson, D. B., & Smid, M. E. (2007) · doi:10.6028/nist.sp.800-56ar · Cited by 65
Bassham, L. E., Polk, W. T., & Housley, R. (2002) · doi:10.17487/rfc3279 · Cited by 59
Elliptic Curve Algorithm Integration in the Secure Shell Transport Layer
Stebila, D., & Green, J. (2009) · doi:10.17487/rfc5656 · Cited by 28
Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS)
Blake-Wilson⋆⋆, S., Brown, D. R. L., & Lambert, P. A. (2002) · doi:10.17487/rfc3278 · Cited by 25
Recommendation for key management, part 1 :
Barker, E. B., Barker, W. C., Burr, W. E., Polk, W. T., & Smid, M. E. (2005) · doi:10.6028/nist.sp.800-57p1 · Cited by 22
Diffie-Hellman Group Exchange for the Secure Shell (SSH) Transport Layer Protocol
Friedl, M., Provos, N., & Simpson, W. (2006) · doi:10.17487/rfc4419 · Cited by 17
Cited by
Sorted by citations
IP Security (IPsec) and Internet Key Exchange (IKE) Document Roadmap
Frankel, S. E., & Krishnan, S. (2011) · doi:10.17487/rfc6071 · Cited by 187
Dragonblood: Analyzing the Dragonfly Handshake of WPA3 and EAP-pwd
Vanhoef, M., & Ronen, E. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00031 · Cited by 179
ZRTP: Media Path Key Agreement for Unicast Secure RTP
Zimmermann, P. R., & Callas, J. (2011) · doi:10.17487/rfc6189 · Cited by 113
Recommendation for Key Management Part 3: Application-Specific Key Management Guidance
Barker, E. B., & Dang, Q. H. (2015) · doi:10.6028/nist.sp.800-57pt3r1 · Cited by 96
Fundamental Elliptic Curve Cryptography Algorithms
McGrew, D., Igoe, K., & Salter, M. (2011) · doi:10.17487/rfc6090 · Cited by 81
Metadata
- Authors
- Lepinski, M., & Kent, S.
- Publisher
- RFC Editor
- Published
- 2008-01
- OpenAlex
- W2266595357
- Cited by
- 47
- References
- 22
- Citations by year
- 2026: 1 · 2025: 3 · 2023: 2 · 2022: 4 · 2021: 1 · 2020: 2 · 2019: 4 · 2018: 3 · 2017: 2 · 2016: 1 · 2015: 3 · 2014: 6 · 2013: 3 · 2012: 4
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Funders
- National Institute of Standards and Technology
- Topics
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- key exchange, IETF standards
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
