Universal hashing based on field multiplication and (near-)MDS matrices

DOI10.1007/978-3-031-37679-5_6MaRDI QIDQ6186343

Joan Daemen, Jonathan Fuchs, Koustabh Ghosh, Parisa Amiri Eliasi

Publication date: 2 February 2024

Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure hardware implementation of nonlinear functions in the presence of glitches
• The design of Rijndael. The Advanced Encryption Standard (AES)
• New hash functions and their use in authentication and set equality
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• Keying Hash Functions for Message Authentication
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Fast Software Encryption
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: Universal hashing based on field multiplication and (near-)MDS matrices