On the security of keyed hashing based on public permutations

DOI10.1007/978-3-031-38548-3_20OpenAlexW4385654154MaRDI QIDQ6186773

Yann Rotella, Joan Daemen, Jonathan Fuchs

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_20

zbMATH Keywords

serialparalleluniversal hashingdifferential probabilitykeyed hashingpublic permutations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• How to stretch random functions: The security of protected counter sums
• A construction of a cipher from a single pseudorandom permutation.
• Full-state keyed duplex with built-in multi-user support
• Thinking outside the superbox
• Keying Hash Functions for Message Authentication
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• A MAC Mode for Lightweight Block Ciphers
• Differential Propagation Analysis of Keccak
• On the Indifferentiability of the Sponge Construction
• Fast Software Encryption
• Fast Software Encryption
• Fast Software Encryption