A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs

DOI10.1007/978-3-642-13858-4_12zbMath1279.94138OpenAlexW1504121796MaRDI QIDQ3577960

Mridul Nandi

Publication date: 13 July 2010

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13858-4_12

zbMATH Keywords

random permutationPRFaffine domain extensionCBC-MAC

Mathematics Subject Classification ID

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

Related Items (6)

PMAC with Parity: Minimizing the Query-Length Influence ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Key-reduced variants of 3Kf9 with beyond-birthday-bound security ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ On the optimality of non-linear computations for symmetric key primitives

Uses Software

• OMAC

This page was built for publication: A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs