Improved security analysis for OMAC as a pseudorandom function

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...

Full description

Bibliographic Details
Main Author: Nandi Mridul
Format: Article
Language:English
Published: De Gruyter 2009-08-01
Series:Journal of Mathematical Cryptology
Subjects:
mac
pmac
distinguishing attack
pseudorandom function
random permutation
Online Access:https://doi.org/10.1515/JMC.2009.006

Internet

https://doi.org/10.1515/JMC.2009.006

Similar Items