Abstract
In this paper, we propose an improved Poly1305 MAC, called IPMAC. IPMAC is a refinement of Poly1305 MAC shown by Bernstein. We use only one 16-byte key and one 16-byte nonce for IPMAC while Poly1305 MAC uses two 16-byte keys and one 16-byte nonce, 48-byte in total. The cost of reducing the size of secret keys is almost negligible: only one encryption. Similarly to Poly1305 MAC, our algorithm correctly and efficiently handles messages of arbitrary bit length. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Wang, D., Lin, D., & Wu, W. (2006). An improved poly1305 MAC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3989 LNCS, pp. 284–292). Springer Verlag. https://doi.org/10.1007/11767480_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
