Improved security analysis for OMAC as a pseudorandom function
This paper shows that the advantage of any q-query adversary (which makes at most q queries) for distinguishing OMAC from a uniform random function is roughly Lq2/2n. Here L is the number of blocks of the longest query and n is the output size of the uniform random function. The so far best bound is...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2009-08-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/JMC.2009.006 |