Sciweavers

Share
FSE
1997
Springer

Fast Message Authentication Using Efficient Polynomial Evaluation

11 years 10 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
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. Key words: Message authentication, universal hash functions, polynomial evaluation, software MAC generation.
Valentine Afanassiev, Christian Gehrmann, Ben J. M
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 1997
Where FSE
Authors Valentine Afanassiev, Christian Gehrmann, Ben J. M. Smeets
Comments (0)
books