Square hash with a small key size

DOI10.1007/3-540-45067-X_45MaRDI QIDQ4450783zbMATH OpenFDO

Authors Swee-Huay Heng, Kaoru Kurosawa

Publication date 16 February 2004

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/2727/27270522.htm

zbMATH Keywords

Message authentication codessquare hashuniversal hash

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• SQUARE HASH: Fast message authentication via optimized universal hash functions
• Keyed hash functions
• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 1305436
• A small approximately min-wise independent family of hash functions
• Experimental and Efficient Algorithms
• Simple minimal perfect hashing in less space
• Double-block-length hash function for minimum memory size
• Hashing via finite field
• Compact public key encryption with minimum ideal property of hash functions

Cited in

(2)

• New Constructions of Universal Hash Functions Based on Function Sums
• SQUARE HASH: Fast message authentication via optimized universal hash functions

This page was built for publication: Square hash with a small key size

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