Result: A message authentication code based on unimodular matrix groups
Title:
A message authentication code based on unimodular matrix groups
Authors:
Source:
Advances in cryptology : CRYPTO 2003 (Santa Barbara CA, 17-21 August 2003)Lecture notes in computer science. :500-512
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Algorithme compétitif, Competitive algorithms, Algorithme rapide, Fast algorithm, Algoritmo rápido, Authentification message, Message authentication, Construction modulaire, Modular construction, Construcción modular, Cryptographie, Cryptography, Criptografía, Déterminant, Determinant, Determinante
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Washington, United States
Microsoft Research
Microsoft Research
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Telecommunications and information theory
Telecommunications and information theory
Accession Number:
edscal.15690722
Database:
PASCAL Archive
Further Information
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.