Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Fast message authentication using efficient polynomial evaluation

Afanassiev, Valentine ; Gehrmann, Christian LU and Smeets, Ben LU orcid (1997) 4th International Workshop on Fast Software Encryption, FSE 1997 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1267. p.190-204
Abstract

Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.

Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Message authentication, Polynomial evaluation, Software MAC generation, Universal hash functions
host publication
Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings - 4th International Workshop, FSE 1997, Proceedings
series title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
editor
Biham, Eli
volume
1267
pages
15 pages
publisher
Springer
conference name
4th International Workshop on Fast Software Encryption, FSE 1997
conference location
Haifa, Israel
conference dates
1997-01-20 - 1997-01-22
external identifiers
  • scopus:21744457386
ISSN
0302-9743
1611-3349
ISBN
3540632476
9783540632474
DOI
10.1007/bfb0052346
language
English
LU publication?
yes
additional info
Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.
id
9976cc15-0190-46aa-846b-94984d9855df
date added to LUP
2021-11-05 02:34:15
date last changed
2025-01-13 18:09:51
@inproceedings{9976cc15-0190-46aa-846b-94984d9855df,
  abstract     = {{<p>Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexity software polynomial evaluation procedure, that for large message sizes gives a MAC that has about the same low software complexity as for bucket hashing but requires only small keys and has better security characteristics.</p>}},
  author       = {{Afanassiev, Valentine and Gehrmann, Christian and Smeets, Ben}},
  booktitle    = {{Fast Software Encryption : 4th International Workshop, FSE 1997, Proceedings}},
  editor       = {{Biham, Eli}},
  isbn         = {{3540632476}},
  issn         = {{0302-9743}},
  keywords     = {{Message authentication; Polynomial evaluation; Software MAC generation; Universal hash functions}},
  language     = {{eng}},
  pages        = {{190--204}},
  publisher    = {{Springer}},
  series       = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
  title        = {{Fast message authentication using efficient polynomial evaluation}},
  url          = {{http://dx.doi.org/10.1007/bfb0052346}},
  doi          = {{10.1007/bfb0052346}},
  volume       = {{1267}},
  year         = {{1997}},
}