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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
De Gruyter
2008-07-01
|
| Schriftenreihe: | Journal of Mathematical Cryptology |
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.1515/JMC.2008.007 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|