SHA-3 standard: permutation-based hash and extendable-output functions
Open accessAbstract
NIST) is the official series of publications relating to standards and guidelines adopted and promulgated under the provisions of the Federal Information Security Management Act (FISMA) of 2002.
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
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 KEM selected for standardization in the third round was CRYSTALS-Kyber (ML-KEM).
“The key encapsulation mechanism (KEM) selected for standardization was CRYSTALS-Kyber (ML-KEM [3]).”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [3]
The Introduction describes SHA-3 as a family of hash functions based on KECCAK, and §7 Conformance lists SHA-3 modes. Searches for CRYSTALS-Kyber, ML-KEM, and third-round KEM selection found no passage addressing the claimed selection. (LLM, conf=0.78)
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.
Cites
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607 · see citing works
Recommendation for the Entropy Sources Used for Random Bit Generation
Turan, M. S., Barker, E., Kelsey, J., McKay, K. A., Baish, M. L., & Boyle, M. (2018) · NIST Special Publication 800-90B · doi:10.6028/nist.sp.800-90b · Cited by 489 · see citing works
Status report on the first round of the NIST post-quantum cryptography standardization process
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., et al. (2019) · doi:10.6028/nist.ir.8240 · Cited by 364 · see citing works
Report on lightweight cryptography
McKay, K. A., Bassham, L., Turan, M. S., & Mouha, N. (2017) · doi:10.6028/nist.ir.8114 · Cited by 353 · see citing works
Guide to Operational Technology (OT) security
Stouffer, K., Pease, M., Tang, C., Zimmerman, T., Pillitteri, V., Lightman, S., Hahn, A., Saravia, S., Sherule, A., & Thompson, M. (2023) · doi:10.6028/nist.sp.800-82r3 · Cited by 315 · see citing works
Digital identity guidelines: authentication and lifecycle management
Grassi, P. A., Fenton, J. L., Newton, E. M., Perlner, R. A., Regenscheid, A. R., Burr, W. E., Richer, J. P., Lefkovitz, N. B., Danker, J. M., Choong, Y.-Y., et al. (2017) · doi:10.6028/nist.sp.800-63b · Cited by 261 · see citing works
An introduction to information security
Nieles, M., Dempsey, K., & Pillitteri, V. Y. (2017) · doi:10.6028/nist.sp.800-12r1 · Cited by 164 · see citing works
Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., & Davis, R. (2018) · doi:10.6028/nist.sp.800-56ar3 · Cited by 158 · see citing works
Stateless Hash-Based Digital Signature Standard
National Institute of Standards and Technology (US) (2024) · doi:10.6028/nist.fips.205 · Cited by 131 · see citing works
Self-citationStatus report on the fourth round of the NIST post-quantum cryptography standardization process
Alagic, G., Bros, M., Ciadoux, P., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., et al. (2025) · doi:10.6028/nist.ir.8545 · Cited by 128 · see citing works
Drawz, P. E., Agarwal, A., Dwyer, J. P., Horwitz, E., Lash, J., Lenoir, K., McWilliams, A., Oparil, S., Rahbari-Oskoui, F., Rahman, M., et al. (2020) · JAMA Internal Medicine · doi:10.1001/jamainternmed.2020.5028 · Cited by 105 · see citing works
MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions Protocol
Esgin, M. F., Zhao, R. K., Steinfeld, R., Liu, J. K., & Liu, D. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3354200 · Cited by 96 · see citing works
Recommendation for pair-wise key establishment using integer factorization cryptography
Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R., & Simon, S. (2019) · doi:10.6028/nist.sp.800-56br2 · Cited by 81 · see citing works
Keyed Hash Function Using Hyper Chaotic System with Time-Varying Parameters Perturbation
Liu, H., Kadir, A., & Liu, J. (2019) · IEEE Access · doi:10.1109/access.2019.2896661 · Cited by 47 · see citing works
Gong, S., Tcydenova, E., Jo, J., Lee, Y., & Park, J. H. (2019) · Sustainability · doi:10.3390/su11143889 · Cited by 47 · see citing works
- Authors
- National Institute of Standards and Technology (US)
- Published
- 2015
- OpenAlex
- W2619630761
- Cited by
- 783
- References
- 1
- Citations by year
- 2026: 34 · 2025: 42 · 2024: 82 · 2023: 103 · 2022: 105 · 2021: 80 · 2020: 102 · 2019: 93 · 2018: 50 · 2017: 39 · 2016: 33 · 2015: 12 · 2014: 8
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Funders
- National Institute of Standards and Technology
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- SHA-3, cryptographic hash functions, NIST standards, FISMA
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
