Abstract
We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of which yields the desired MAC. We analyze using the invertibility and the arithmetic properties of the determinants of certain types of matrices; this may be of interest in other applications. Performance results on our preliminary implementations show the speed of our MAC is competitive with recent fast MAC algorithms, achieving 0.5 Gigabytes per second on a 1.06 GHz Celeron. © International Association for Cryptologic Research 2003.
Author supplied keywords
Cite
CITATION STYLE
Cary, M., & Venkatesan, R. (2003). A message authentication code based on unimodular matrix groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2729, 500–512. https://doi.org/10.1007/978-3-540-45146-4_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
