HMAC (Persian Wikipedia)

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

Last modified:

Ref.Un. Ref.Website
Global rank Persian rank
1st place
1st place
299th place
277th place
low place
low place
731st place
844th place
2,146th place
1,586th place
6,361st place
6,199th place

iacr.org (Global: 6,361st place; Persian: 6,199th place)

eprint.iacr.org

ietf.org (Global: 731st place; Persian: 844th place)

  • 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 (Global: 299th place; Persian: 277th place)

citeseerx.ist.psu.edu

schneier.com (Global: low place; Persian: low place)

  • 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 (Global: 2,146th place; Persian: 1,586th place)

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 ژوئیه 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}}: تاریخ وارد شده در |year= / |date= mismatch را بررسی کنید (کمک)

web.archive.org (Global: 1st place; Persian: 1st place)