dogear

enter for all results · esc to close

On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit

eprint.iacr.orgsite

visit eprint.iacr.org ↗
0
sign in to dogear this
from
Papers
added
2026-10-10
likes
0

similar

  1. Cache Attacks and Countermeasures: the Case of AES eprint.iacr.org
    site category #crypto-papers link ↗
  2. Analysis and design of cryptographic hash functions, MAC algorithms and block ciphers web.archive.org
    site category #crypto-papers link ↗
  3. GCM Security Bounds Reconsidered iacr.org
    site category #crypto-papers link ↗
  4. Statistical Cryptanalysis of Block Ciphers crypto.junod.info
    site category #crypto-papers link ↗
  5. On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 eprint.iacr.org
    site category #crypto-papers link ↗
  6. Another Look at “Provable Security” eprint.iacr.org
    site category #crypto-papers link ↗

Papers › The list > Specific topics > Hashing: “Security of randomized CBC-MACs and a new construction that resists birthday paradox attacks and provably reaches full security, by E. Jaulmes et al.”