The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
HMAC: Keyed-Hashing for Message Authentication
Abstract
This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key. The cryptographic strength of HMAC depends on the properties of the underlying hash function. 1.
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.
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Kent, S. (2005) · doi:10.17487/rfc4302 · Cited by 780
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
Pseudorandom functions revisited: the cascade construction and its concrete security
Bellare, M., Canetti, R., & Krawczyk, H. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548510 · Cited by 208
Self-citationParallel collision search with application to hash functions and discrete logarithms
van Oorschot, P. C., & Wiener, M. J. (1994) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/191177.191231 · Cited by 146
Message authentication with one-way hash functions
Tsudik, G. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263477 · Cited by 100
Cited by
The Internet of Things: A survey
Atzori, L., Iera, A., & Morabito, G. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.05.010 · Cited by 15,613
IoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488
Dierks, T., & Allen, C. (1999) · doi:10.17487/rfc2246 · Cited by 1,654
(2016) · IACR Cryptology ePrint Archive · Cited by 1,288
Secure Routing in Mobile Ad hoc Networks
(2022) · doi:10.22271/ed.book.2027 · Cited by 1,227
Metadata
- Authors
- Krawczyk, H., Bellare, M., & Canetti, R.
- Publisher
- RFC Editor
- Published
- 1997-02
- OpenAlex
- W1656678770
- Cited by
- 2,031
- References
- 6
- 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
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.