HMAC (Persian Wikipedia)

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

refsWebsite

Global rank Persian rank

4web.archive.org

1^st place

3psu.edu

207^th place

287^th place

1schneier.com

8,888^th place

low place

1ietf.org

214^th place

1,769^th place

1ucsd.edu

1,933^rd place

1,912^th place

1iacr.org

5,032^nd place

low place

iacr.org

eprint.iacr.org

Jongsung, Kim (2006). "On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1" (PDF). Archived from the original (PDF) on 12 May 2013. Retrieved 5 December 2010. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)نگهداری CS1: پست اسکریپت (link)

ietf.org

IETF (February 1997). "RFC 2104". Retrieved 2009-12-03. 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.

psu.edu

citeseerx.ist.psu.edu

Bellare, Mihir; Canetti, Ran; Krawczyk, Hugo (1996). "Keying Hash Functions for Message Authentication".{{cite web}}: نگهداری CS1: پست اسکریپت (link)
Preneel, Bart; van Oorschot, Paul C. (1995). "MDx-MAC and Building Fast MACs from Hash Functions". Archived from the original on 4 June 2010. Retrieved 2009-08-28.{{cite web}}: نگهداری CS1: پست اسکریپت (link)
Preneel, Bart; van Oorschot, Paul C. (1995). "On the Security of Two MAC Algorithms". Archived from the original on 23 February 2009. Retrieved 2009-08-28.{{cite web}}: نگهداری CS1: پست اسکریپت (link)

schneier.com

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

ucsd.edu

cseweb.ucsd.edu

Bellare, Mihir (June 2006). "New Proofs for NMAC and HMAC: Security without Collision-Resistance". In Dwork, Cynthia (ed.). Advances in Cryptology – Crypto 2006 Proceedings. Lecture Notes in Computer Science 4117. Springer-Verlag. Archived from the original on 16 July 2011. Retrieved 2010-05-25. 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. {{cite conference}}: نگهداری یادکرد:تاریخ و سال (link)

web.archive.org

Preneel, Bart; van Oorschot, Paul C. (1995). "MDx-MAC and Building Fast MACs from Hash Functions". Archived from the original on 4 June 2010. Retrieved 2009-08-28.{{cite web}}: نگهداری CS1: پست اسکریپت (link)
Preneel, Bart; van Oorschot, Paul C. (1995). "On the Security of Two MAC Algorithms". Archived from the original on 23 February 2009. Retrieved 2009-08-28.{{cite web}}: نگهداری CS1: پست اسکریپت (link)
Bellare, Mihir (June 2006). "New Proofs for NMAC and HMAC: Security without Collision-Resistance". In Dwork, Cynthia (ed.). Advances in Cryptology – Crypto 2006 Proceedings. Lecture Notes in Computer Science 4117. Springer-Verlag. Archived from the original on 16 July 2011. Retrieved 2010-05-25. 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. {{cite conference}}: نگهداری یادکرد:تاریخ و سال (link)
Jongsung, Kim (2006). "On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1" (PDF). Archived from the original (PDF) on 12 May 2013. Retrieved 5 December 2010. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)نگهداری CS1: پست اسکریپت (link)