The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index.
Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography
Open accessAbstract
This publication has been developed by the National Institute of Standards and Technology (NIST) in accordance with its statutory responsibilities under the Federal Information Security Modernization Act (FISMA) of 2014, 44 U.S.C. § 3551 et seq., Public Law (P.L.) 113-283.NIST is responsible for developing information security standards and guidelines, including minimum requirements for federal information systems, but such standards and guidelines shall not apply to national security systems without the express approval of appropriate federal officials exercising policy authority over such systems.This guideline is consistent with the requirements of the Office of Management and Budget (OMB) Circular A-130.Nothing in this publication should be taken to contradict the standards and guidelines made mandatory and binding on federal agencies by the Secretary of Commerce under statutory authority.Nor should these guidelines be interpreted as altering
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The cited source says what the claim attributes to it.
In the citing paper
“NIST changed this recommendation in the 3rd revision of SP800-56A [4], and are now advocating using a fixed set of safe-prime groups with moduli of length up to 8192 bits, with short or full length exponents.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [4]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Note that an n bit prime order elliptic curve group provides approximately n/ 2 bits of classical security (see Appendix D to [4]), since the best classical attacks are cycle-finding attacks, whilst RSA-1024, RSA-2048 and RSA-3072 provide approximately 80 , 112 and 128 bits of classical security, respectively, according to the model used by NIST (see Appendix D to [5]).”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [4]
Experimental — accuracy not yet measured
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
Cites
SHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783
(2015) · doi:10.6028/nist.fips.180-4 · Cited by 542
Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths
Barker, E. B., & Roginsky, A. L. (2015) · doi:10.6028/nist.sp.800-131ar1 · Cited by 198
Self-citationElliptic 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
Security requirements for cryptographic modules
Security, C. C., Evans, D. L., Brown, K. H., Director, A., & Director, W. M. (2001) · doi:10.6028/nist.fips.140-2 · Cited by 160
SHA-3 derived functions: cSHAKE, KMAC, TupleHash and ParallelHash
Kelsey, J. M., Change, S.-J., & Perlner, R. A. (2016) · doi:10.6028/nist.sp.800-185 · Cited by 154
Recommendation for block cipher modes of operation :
Dworkin, M. J. (2015) · doi:10.6028/nist.sp.800-38b · Cited by 114
Recommendation for key derivation using pseudorandom functions (revised)
Chen, L. (2009) · doi:10.6028/nist.sp.800-108 · Cited by 76
Self-citationMcKay, K. A., & Cooper, D. A. (2019) · doi:10.6028/nist.sp.800-52r2 · Cited by 66
Recommendation for Cryptographic Key Generation
Barker, E. B., & Roginsky, A. L. (2012) · doi:10.6028/nist.sp.800-133 · Cited by 54
Self-citation
Research works printed but not linked: 3
- S. Blake-Wilson, A. Menezes, Unknown Key-Share Attacks on the Station- to-Station (STS) Protocol, Technical Report CORR 98-42, University of Waterloo, 1998. Available at: http://cacr.math.uwaterloo.ca.
- A. Menezes, Another look at HMQV. Journal of Mathematical Cryptology, Vol.1(1), pp. 47-64, 2007
- Section 5.7.2.3: Clarified error handling in step 3. This publication is available free of charge from: https://doi.org/10.6028/NIST.SP.800-56Ar3 47. Section 6.2.1.1-6.2.1.4: Clarified error handling. 48. Section 6.2.2: Modified the first assumption to refer to Section 5.5.1 for the domain parameter information. Now refer to Section 5.9.3 for the minimum MacKey and Mac tag lengths. 49. Section 6.2.2.1-6.2.2.2: Clarified error handling. · DOI
Cited by
Sorted by citations
Items 101–157 of 157
Generation of Symmetric Key Using Randomness of Hash Function
Charan, K. S., Nakkina, H. V., & Chandavarkar, B. R. (2020) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt49239.2020.9225280 · Cited by 2
CMVP approved sensitive parameter generation and establishment methods:
Schaffer, K. (2020) · doi:10.6028/nist.sp.800-140d · Cited by 2
Overview and Considerations of Access Control Based on Attribute Encryption
Hu, V. C. (2022) · doi:10.6028/nist.ir.8450.ipd · Cited by 3
RetractedA Note on Subgroup Security in Discrete Logarithm-Based Cryptography
Teruya, T. (2020) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2020cip0019 · Cited by 1
AuthPLC: Authenticating PLC Communication Using ST-based Extended Cryptographic Library
Yang, Y., Iván, C., Yang, Z., Yang, J., Wang, H., Yang, Z., & Zhou, J. (2025) · ACM Workshop on Cyber-Physical System Security (CPSS) · doi:10.1145/3709017.3737708 · Cited by 1
Kishi, K., Yamaguchi, J., Izu, T., & Kunihiro, N. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3591213 · Cited by 1
A Prototype for Privacy-preserving and Compliant Offline CBDC Transactions
Michalopoulos, P., Mack, A., Clark, C., Chen, L., Sedlmeir, J., & Veneris, A. G. (2025) · Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS) · doi:10.1109/brains67003.2025.11302918 · Cited by 1
Self-citationA systematic review on the current scenarios and future frontiers for securing smart grid systems
Sivakumar, E., Ganesan, G., Premkumar, R., Rani, R. H. J., & Srinivasan, K. (2026) · Discover Computing · doi:10.1007/s10791-026-10348-x · Cited by 1
Lightweight Key Establishment for WSNs
Lara-Nino, C. A., Morales‐Sandoval, M., & Díaz-Pérez, A. (2019) · IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) · doi:10.1109/pacrim47961.2019.8985101 · Cited by 1
Removable weak keys for discrete logarithm-based cryptography
Jacobson, M. J., & Kushwaha, P. (2020) · Journal of Cryptographic Engineering · doi:10.1007/s13389-020-00250-7 · Cited by 1
Privacy-aware document retrieval with two-level inverted indexing
Qiao, Y., Ji, S., Wang, C., Shao, J., & Yang, T. (2023) · Information Retrieval · doi:10.1007/s10791-023-09428-z · Cited by 2
Crocetti, L., Nannipieri, P., Matteo, S. D., & Saponara, S. (2023) · Electronics · doi:10.3390/electronics12234843 · Cited by 1
Procurement of QKD Technology Platform as a Logic Puzzle Solution
Balodis, R., & Opmane, I. (2024) · Smart innovation, systems and technologies · doi:10.1007/978-981-99-8612-5_36 · Cited by 1
Sandbox Environment for Offensive and Defensive Training in Smart Metering
Kohout, D., Lazarov, W., Lieskovan, T., & Mlýnek, P. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-4677-4_5 · Cited by 1
Blockchain-Kryptografie: Teil 2
Hellwig, D., Karlic, G., & Huchzermeier, A. (2021) · Springer eBooks · doi:10.1007/978-3-662-62966-6_7 · Cited by 1
Video Conference Software Inplementation Based on Data Encryption Using Elliptic Curves
Safaryan, O. A., Cherckesova, L. V., Вячеславович, Б. Н., Pilipenko, I. A., Nikishina, T., Medvedev, D., & Lobodenko, A. G. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2131/3/032112 · Cited by 1
Guide to IPsec VPNsPreprint
(2019) · doi:10.6028/nist.sp.800-77r1-draft · Cited by 1
Guideline for Using Cryptographic Standards in the Federal Government:Preprint
(2019) · doi:10.6028/nist.sp.800-175br1-draft · Cited by 1
CMVP approved sensitive security parameter generation and establishment methods :
Schaffer, K., & Calis, A. (2022) · doi:10.6028/nist.sp.800-140dr1 · Cited by 1
Noh, S., Firdaus, M., & Rhee, K.-H. (2023) · Frontiers in Public Health · doi:10.3389/fpubh.2023.1133142 · Cited by 1
Protecting Controlled Unclassified Information in Nonfederal Systems and Organizations
Ross, R., & Pillitteri, V. Y. (2023) · doi:10.6028/nist.sp.800-171r3.fpd · Cited by 1
RetractedHybrid Encryption for Smart Home Healthcare: Ensuring Data Confidentiality and SecurityPreprint
Popoola, O. J., Rodrigues, M., Marchang, J., Shenfield, A., Ikpehai, A., & Popoola, J. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4839240 · Cited by 1
Linha de base do n cleo de recursos de ciberseguran a de dispositivos IoT
Fagan, M. E., Megas, K. N., Scarfone, K. A., & Smith, M. (2020) · doi:10.6028/nist.ir.8259apt
Referencia b sica de las capacidades de ciberseguridad de los dispositivos de IoT
Fagan, M. E., Megas, K. N., Scarfone, K. A., & Smith, M. (2020) · doi:10.6028/nist.ir.8259aes
NVLAP cryptographic and security testing
Moore, B., Fox, J., French, C., Moore, B., & Trapnell, B. (2021) · doi:10.6028/nist.hb.150-17-2021
National Voluntary Laboratory Accreditation Program (NVLAP) cryptographic and security testing
Moore, B., Trapnell, B., Fox, J., & French, C. (2022) · doi:10.6028/nist.hb.150-17e2022
Efficient Scalar Multiplication on Koblitz Curves with Pre-computation
Li, X., Yu, W., & Wang, K. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22390-7_11
SAS-GKE: A Secure Authenticated Scalable Group Key Exchange
Faisal, A. M., & Zulkernine, M. (2022) · IEEE International Conference on Software Quality, Reliability and Security (QRS) · doi:10.1109/qrs57517.2022.00064
Interfaces for Personal Identity Verification:
Ferraiolo, H., Mehta, K., Francomacaro, S., Chandramouli, R., & Gupta, S. (2023) · doi:10.6028/nist.sp.800-73pt2-5.ipd
RetractedDevice Onboarding using FDO and the Untrusted Installer Model
Cooper, G. H. (2023) · Queue · doi:10.1145/3631327
A Security-Focused Architecture for Gameplay Telemetry in Serious Games
Bodenschatz, S., Mentler, T., & Rezk‐Salama, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49065-1_41
MASTERING CLOUD SECURITY: TECHNIQUES AND BEST PRACTICES
Haq, M. N. U., & Sharma, M. K. (2023) · GRF BOOKS · doi:10.52458/9788196869434.2023.eb.grf.ch-07 · Cited by 1
A troyan Diffie-Hellman-like protocol based on proof of gullibility
Ceria, M., Piccoli, A. D., Moriarty, T., & Visconti, A. (2024) · International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA) · doi:10.1109/acdsa59508.2024.10468029
Flexible Encryption Tunnel with Limited Quantum Key Distribution over Classical Optical Networks
Liu, Y., Yu, X., & Zhao, Y. (2025) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/icnc64010.2025.10993946
An Attack on TON's ADNL Secure Channel Protocol
Frenkel, A., & Kogan, D. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00169
New types of formula for isogenies between elliptic curves
Dang, T., & Moody, D. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01692-y
Mobile Cell-Based Road Pricing with Verifiable User Privacy
Bouez, A., Verheul, E. R., & Mennink, B. (2025) · IACR Communications in Cryptology · doi:10.62056/ana66chdj
Integrating PQC in OpenSSL via Shallow Providers for Cryptographic Agility
Mehmood, A., & Tuveri, N. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-14782-0_2
Hybrid security solutions for IoT devices
Haenel, A. (2024) · theses.fr (ABES) · doi:10.70675/e3673de3zafa5z48c8z8ff3z3af2366dd23c
Performance Analysis of Field-Level Encryption on Structured Sensitive Data Using Elliptic Curves
Baraj, A., & Lerga, J. (2026) · International Symposium on Digital Forensics and Security (ISDFS) · doi:10.1109/isdfs69419.2026.11459077
Secure Deployment of Smart Meters
Kohout, D., Lieskovan, T., Mlýnek, P., Fujdiak, R., & Jaskolka, J. (2026) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.70292
Adapting the BIKE Key Encapsulation Mechanism to Memory-Constrained IoT Devices
Čatloch, D., Pekarčík, P., & Chovancová, E. (2026) · Cryptography · doi:10.3390/cryptography10020024
Cloud-Assisted Privacy-Preserving Safety Monitoring Scheme for Online Ride-Hailing Services
Lai, C., Ma, J., Liu, Z., & Zhou, H. J. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3689082
Medical IoT Authentication and Security Through Three Point Authentication and Access Token
Thakur, P. K., Benke, H. R., Shankar, H., Biswas, P., & Kar, N. (2026) · IEEE International Conference for Convergence in Computing Technology (I3CTCON) · doi:10.1109/i3ctcon68242.2026.11507167
SlimFit-Gens: Toward Low Bandwidth One-on-One Video Calls on COTS Smartphones
Zhu, J., Sun, L., Cao, F., Yang, B., Dong, P., Li, W., Xu, Y., Wu, H. W., Han, H., Xu, F., et al. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3693712
Towards Cryptography Bill of Materials Compliance
Foroncelli, C., Matteis, P. D., Knob, L. A. D., Piras, L., Tomasi, A., & Ranise, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-19567-8_10
D’Erme, F. P. (2026) · Springer eBooks · doi:10.1007/978-3-032-30243-4_8
Sensitive Security Parameter Management
Aster (2026) · Springer eBooks · doi:10.1007/978-3-032-30243-4_29
Nauroth, M., Kuntze, N., & Rohlmann, S. (2026) · Communications in computer and information science · doi:10.1007/978-981-92-5039-4_3
Aljassim, S., Hussain, M. A., Abduljabbar, Z. A., AL-Asadi, H. A. A., Nyangaresi, V. O., Ali, A. H., & Aldarwish, A. J. Y. (2026) · Cybernetics and Information Technologies · doi:10.2478/cait-2026-0025
Yung, M. M., Yampolskiy, M., Dolgavin, A., Gatlin, J., Pearce, H. A., & Gupta, N. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38695-3_21
Hammood, H. L., Hussein, H. I., Jameel, J. S., Bash, H. A., & Abedi, F. (2026) · Multimedia Tools and Applications · doi:10.1007/s11042-026-21949-5
Eliminating PKI Overhead in Kerberos: a FIDO2 Hardware Key Pre-Authentication Framework
Bhattacharya, A., & Sethia, D. (2026) · International Conference on Networks, Computers and Communications (ICNCCom) · doi:10.1109/icnccom69117.2026.11736299
Metadata
- Authors
- Barker, E., Chen, L., Roginsky, A., Vassilev, A., & Davis, R.
- Affiliations
- Information Technology Laboratory (US)
- National Institute of Standards and Technology (US)
- Published
- 2018-04
- OpenAlex
- W4298016935
- Cited by
- 158
- References
- 17
- Citations by year
- 2026: 19 · 2025: 13 · 2024: 14 · 2023: 16 · 2022: 20 · 2021: 19 · 2020: 35 · 2019: 19 · 2018: 3
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Funders
- Information Technology Laboratory
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- pairwise key establishment, key exchange, public-key cryptography, cryptographic standards, digital signatures
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
