Analysis of information sources in references of the Wikipedia article "HMAC" in Persian language version.
Last modified:
{{cite journal}}: از پارامتر ناشناخته |coauthors= صرف نظر شد (|author= پیشنهاد میشود) (کمک); یادکرد journal نیازمند |journal= است (کمک)نگهداری یادکرد:پینوشت (رده)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.
{{cite web}}: نگهداری یادکرد:پینوشت (رده){{cite web}}: نگهداری یادکرد:پینوشت (رده){{cite web}}: نگهداری یادکرد:پینوشت (رده)although it doesn't affect applications such as HMAC where collisions aren't important
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 را بررسی کنید (کمک){{cite web}}: نگهداری یادکرد:پینوشت (رده){{cite web}}: نگهداری یادکرد:پینوشت (رده)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 را بررسی کنید (کمک){{cite journal}}: از پارامتر ناشناخته |coauthors= صرف نظر شد (|author= پیشنهاد میشود) (کمک); یادکرد journal نیازمند |journal= است (کمک)نگهداری یادکرد:پینوشت (رده)