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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
De Gruyter
2008-07-01
|
| Serie: | Journal of Mathematical Cryptology |
| Soggetti: | |
| Accesso online: | https://doi.org/10.1515/JMC.2008.007 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|