Revisiting structure graphs: Applications to CBC-MAC and EMAC
In [2], Bellare, Pietrzak and Rogaway proved an O(ℓq2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ℓ<2n/3${\ell<2^{n/3}}$. Here an adversary can make at most q prefix-free queries each having at...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2016-12-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2016-0030 |