Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
- 21 March 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- LFSR-based Hashing and AuthenticationPublished by Springer Science and Business Media LLC ,2001
- UMAC: Fast and Secure Message AuthenticationLecture Notes in Computer Science, 1999
- MMH: Software message authentication in the Gbit/second ratesLecture Notes in Computer Science, 1997
- Fast message authentication using efficient polynomial evaluationLecture Notes in Computer Science, 1997
- On Fast and Provably Secure Message Authentication Based on Universal HashingLecture Notes in Computer Science, 1996
- Fast Hashing on the PentiumLecture Notes in Computer Science, 1996
- Message authentication with one-way hash functionsACM SIGCOMM Computer Communication Review, 1992
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979