HMAC (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "HMAC" in English language version.

refsWebsite

Global rank English rank

4ietf.org

214^th place

176^th place

4doi.org

2^nd place

3psu.edu

207^th place

136^th place

3nist.gov

355^th place

454^th place

3iacr.org

5,032^nd place

3,357^th place

2ucsd.edu

1,933^rd place

1,342^nd place

1keccak.team

low place

1schneier.com

8,888^th place

6,276^th place

1mathiasbynens.be

low place

1pthree.org

low place

1rfc-editor.org

6,184^th place

4,465^th place

1worldcat.org

5^th place

doi.org

H. Krawczyk; M. Bellare; R. Canetti (February 1997). HMAC: Keyed-Hashing for Message Authentication. Network Working Group. doi:10.17487/RFC2104. RFC 2104. Informational. Updated by RFC 6151.
H. Krawczyk; M. Bellare; R. Canetti (February 1997). HMAC: Keyed-Hashing for Message Authentication. Network Working Group. doi:10.17487/RFC2104. RFC 2104. Informational. sec. 6. Updated by RFC 6151. The strongest attack known against HMAC is based on the frequency of collisions for the hash function H ("birthday attack") [PV,BCK2], and is totally impractical for minimally reasonable hash functions.
S. Turner; L. Chen (March 2011). Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms. IETF. doi:10.17487/RFC6151. RFC 6151. Informational. Updates RFC 2104 and 1321.
Eastlake 3rd, D.; Hansen, T. (May 2011). US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF). Internet Engineering Task Force. doi:10.17487/RFC6234. ISSN 2070-1721. RFC 6234.{{citation}}: CS1 maint: numeric names: authors list (link) Informational. Obsoletes RFC 4634. Updates RFC 3174

iacr.org

eprint.iacr.org

Bellare, Mihir. "New Proofs for NMAC and HMAC: Security without Collision-Resistance" (PDF). Journal of Cryptology. Retrieved 15 December 2021. This paper proves that HMAC is a PRF under the sole assumption that the compression function is a PRF. This recovers a proof based guarantee since no known attacks compromise the pseudorandomness of the compression function, and it also helps explain the resistance-to-attack that HMAC has shown even when implemented with hash functions whose (weak) collision resistance is compromised.
Jongsung, Kim; Biryukov, Alex; Preneel, Bart; Hong, Seokhie (2006). "On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1" (PDF). SCN 2006. Springer-Verlag.

iacr.org

Wang, Xiaoyun; Yu, Hongbo; Wang, Wei; Zhang, Haina; Zhan, Tao (2009). "Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC" (PDF). Retrieved 15 June 2015. {{cite journal}}: Cite journal requires |journal= (help)

ietf.org

datatracker.ietf.org

H. Krawczyk; M. Bellare; R. Canetti (February 1997). HMAC: Keyed-Hashing for Message Authentication. Network Working Group. doi:10.17487/RFC2104. RFC 2104. Informational. Updated by RFC 6151.
H. Krawczyk; M. Bellare; R. Canetti (February 1997). HMAC: Keyed-Hashing for Message Authentication. Network Working Group. doi:10.17487/RFC2104. RFC 2104. Informational. sec. 6. Updated by RFC 6151. The strongest attack known against HMAC is based on the frequency of collisions for the hash function H ("birthday attack") [PV,BCK2], and is totally impractical for minimally reasonable hash functions.
S. Turner; L. Chen (March 2011). Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms. IETF. doi:10.17487/RFC6151. RFC 6151. Informational. Updates RFC 2104 and 1321.
Eastlake 3rd, D.; Hansen, T. (May 2011). US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF). Internet Engineering Task Force. doi:10.17487/RFC6234. ISSN 2070-1721. RFC 6234.{{citation}}: CS1 maint: numeric names: authors list (link) Informational. Obsoletes RFC 4634. Updates RFC 3174

keccak.team

Keccak team. "Keccak Team – Design and security". Retrieved 31 October 2019. Unlike SHA-1 and SHA-2, Keccak does not have the length-extension weakness, hence does not need the HMAC nested construction. Instead, MAC computation can be performed by simply prepending the message with the key.

mathiasbynens.be

"PBKDF2+HMAC hash collisions explained · Mathias Bynens". mathiasbynens.be. Retrieved 7 August 2019.

nist.gov

csrc.nist.gov

"FIPS 198-1: The Keyed-Hash Message Authentication Code (HMAC)". Federal Information Processing Standards. 16 July 2008.
"FIPS 180-2 with Change Notice 1" (PDF). csrc.nist.gov.

nist.gov

Dworkin, Morris (4 August 2015). "SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions". Federal Information Processing Standards – via NIST Publications.

psu.edu

citeseerx.ist.psu.edu

Bellare, Mihir; Canetti, Ran; Krawczyk, Hugo (1996). "Keying Hash Functions for Message Authentication" (PDF). pp. 1–15. CiteSeerX 10.1.1.134.8430.
Preneel, Bart; van Oorschot, Paul C. (1995). "MDx-MAC and Building Fast MACs from Hash Functions". CiteSeerX 10.1.1.34.3855. {{cite journal}}: Cite journal requires |journal= (help)
Preneel, Bart; van Oorschot, Paul C. (1995). "On the Security of Two MAC Algorithms". CiteSeerX 10.1.1.42.8908. {{cite journal}}: Cite journal requires |journal= (help)

pthree.org

"Aaron Toponce : Breaking HMAC". Retrieved 7 August 2019.

rfc-editor.org

"RFC 2104 Errata Held for Document Update · Erdem Memisyazici". www.rfc-editor.org. Retrieved 23 September 2016.

schneier.com

Schneier, Bruce (August 2005). "SHA-1 Broken". Retrieved 9 January 2009. although it doesn't affect applications such as HMAC where collisions aren't important

ucsd.edu

cseweb.ucsd.edu

Bellare, Mihir; Canetti, Ran; Krawczyk, Hugo (1996). "Keying Hash Functions for Message Authentication" (PDF). pp. 1–15. CiteSeerX 10.1.1.134.8430.
Bellare, Mihir; Canetti, Ran; Krawczyk, Hugo (Spring 1996). "Message Authentication using Hash Functions—The HMAC Construction" (PDF). CryptoBytes. 2 (1).

worldcat.org

search.worldcat.org

Eastlake 3rd, D.; Hansen, T. (May 2011). US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF). Internet Engineering Task Force. doi:10.17487/RFC6234. ISSN 2070-1721. RFC 6234.{{citation}}: CS1 maint: numeric names: authors list (link) Informational. Obsoletes RFC 4634. Updates RFC 3174