Improved security analysis of PMAC
In this paper we provide a simple, concrete and improved security analysis of Parallelizable Message Authentication Code or PMAC. In particular, we show that the advantage of any distinguisher at distinguishing PMAC from a random function is at most (5qσ – 3.5q2)/2n. Here, σ is the total number of...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
De Gruyter
2008-07-01
|
| Col·lecció: | Journal of Mathematical Cryptology |
| Matèries: | |
| Accés en línia: | https://doi.org/10.1515/JMC.2008.007 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|