The DOI matches its Crossref record.
Secure hash standard
Open accessAbstract
This standard specifies hash algorithms that can be used to generate digests of messages.The digests are used to detect whether messages have been changed since the digests were generated.
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
Blockchain technology overview
Yaga, D., Mell, P., Roby, N., & Scarfone, K. (2018) · doi:10.6028/nist.ir.8202 · Cited by 1,551
Hossain, E., Khan, I., Un-Noor, F., Sikander, S. S., & Sunny, M. S. H. (2019) · IEEE Access · doi:10.1109/access.2019.2894819 · Cited by 513
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
Ascon v1.2: Lightweight Authenticated Encryption and Hashing
Dobraunig, C., Eichlseder, M., Mendel, F., & Schläffer, M. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09398-9 · Cited by 478
Recommendation for Key Management Part 1: General
Barker, E. (2016) · doi:10.6028/nist.sp.800-57pt1r4 · Cited by 396
One molecular fingerprint to rule them all: drugs, biomolecules, and the metabolome
Capecchi, A., Probst, D., & Reymond, J.-L. (2020) · Journal of Cheminformatics · doi:10.1186/s13321-020-00445-4 · Cited by 363
Report on lightweight cryptography
McKay, K. A., Bassham, L., Turan, M. S., & Mouha, N. (2017) · doi:10.6028/nist.ir.8114 · Cited by 353
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
Recommendation for key management: part 1 - general
Barker, E. (2020) · doi:10.6028/nist.sp.800-57pt1r5 · Cited by 271
Module-Lattice-Based Key-Encapsulation Mechanism Standard
National Institute of Standards and Technology (US) (2024) · doi:10.6028/nist.fips.203 · Cited by 268
Self-citationAn introduction to information security
Nieles, M., Dempsey, K., & Pillitteri, V. Y. (2017) · doi:10.6028/nist.sp.800-12r1 · Cited by 164
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
Stateless Hash-Based Digital Signature Standard
National Institute of Standards and Technology (US) (2024) · doi:10.6028/nist.fips.205 · Cited by 131
Self-citationRealizing an Internet of Secure Things: A Survey on Issues and Enabling Technologies
Hamad, S. A., Sheng, Q. Z., Zhang, W. E., & Nepal, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2976075 · Cited by 100
A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution
Alghamdi, Y., Munir, A., & Ahmad, J. (2022) · Entropy · doi:10.3390/e24101344 · Cited by 97
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
Sowa, J., Hoang, B., Yeluru, A., Qie, S., Nikolich, A., Iyer, R., & Cao, P. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00213 · Cited by 15
Yagiz, M. A., Horasan, F., & Yurttakal, A. H. (2026) · arXiv · doi:10.48550/arxiv.2605.00065
Metadata
- Authors
- National Institute of Standards and Technology (US)
- Published
- 2015
- OpenAlex
- W4248987559
- Cited by
- 350
- References
- 0
- Type
- report
- Language
- en
- Open access
- gold
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
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.