A Message Authentication Code Based on Unimodular Matrix Groups

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

• Type: Conference
• Year: 2003
• Where: CRYPTO
• Authors: Matthew Cary, Ramarathnam Venkatesan
• Keywords: Arithmetic Properties, CRYPTO 2003, Determinants, Modular Groups