Montgomery prime hashing for message authentication

DOI10.1007/3-540-36563-X_4MaRDI QIDQ4418526zbMATH OpenFDO

Authors Douglas L. Whiting, Michael J. Sabin

Publication date 10 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2612/26120050.htm

zbMATH Keywords

MACmessage authenticationUniversal hash

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• MMH: Software message authentication in the Gbit/second rates
• SQUARE HASH: Fast message authentication via optimized universal hash functions
• UMAC: Fast and secure message authentication
• Bucket hashing and its application to fast message authentication
• Keyed hash functions

This page was built for publication: Montgomery prime hashing for message authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418526)