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: | Nandi Mridul |
---|---|
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 |
Similar Items
-
Improved security analysis of PMAC
by: Nandi Mridul, et al.
Published: (2008-07-01) -
On Length Independent Security Bounds for the PMAC Family
by: Bishwajit Chakraborty, et al.
Published: (2021-06-01) -
MAC Constructions: Security Bounds and Distinguishing Attacks
by: Mandal, Avradip
Published: (2007) -
New constructions of cryptographic pseudorandom functions
by: Banerjee, Abhishek
Published: (2015) -
MAC Constructions: Security Bounds and Distinguishing Attacks
by: Mandal, Avradip
Published: (2007)