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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
De Gruyter
2009-08-01
|
| Cyfres: | Journal of Mathematical Cryptology |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.1515/JMC.2009.006 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|