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.

• Type: Conference
• Year: 1997
• Where: FSE
• Authors: Valentine Afanassiev, Christian Gehrmann, Ben J. M. Smeets
• Keywords: Cryptology, FSE 1997, Message Authentication, Polynomial Evaluation, Software Polynomial Evaluation