Tight security analysis of the public permutation-based PMAC\_Plus

DOI10.3934/AMC.2023025MaRDI QIDQ6605894zbMATH OpenFDO

Authors Avijit Dutta, Mridul Nandi, Suprita Talnikar

Publication date 16 September 2024

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

zbMATH Keywords

lightweight cryptographypublic permutationcoefficients-H techniqueconstrained resource devicesPMAC PlusPRF constructionsum capture lemma

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11)

Recommendations

• How to build pseudorandom functions from public random permutations
• A new variant of PMAC: beyond the birthday bound
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Categorization of faulty nonce misuse resistant message authentication
• \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations

Cites work

• scientific article; zbMATH DE number 1962141 (Why is no real title available?)
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• 3kf9: enhancing 3GPP-MAC beyond the birthday bound
• A new variant of PMAC: beyond the birthday bound
• BBB secure nonce based MAC using public permutations
• Blockcipher-based MACs: beyond the birthday bound without message length
• Chaskey: an efficient MAC algorithm for 32-bit microcontrollers
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• GIFT: a small present. Towards reaching the limit of lightweight encryption
• Generic attacks against beyond-birthday-bound MACs
• How to build pseudorandom functions from public random permutations
• Improved security analysis of PMAC
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• Minimizing the two-round Even-Mansour cipher
• Multi-user BBB security of public permutations based MAC
• PRESENT: An Ultra-Lightweight Block Cipher
• SPONGENT: The Design Space of Lightweight Cryptographic Hashing
• The PHOTON family of lightweight hash functions
• The security of the cipher block chaining message authentication code
• The sum of CBC MACs is a secure PRF
• The “Coefficients H” Technique
• Tight security bounds for double-block hash-then-sum MACs
• Tight security bounds for key-alternating ciphers
• Tweaking Even-Mansour ciphers
• \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
• \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing

Cited in

(2)

• Farasha: a provable permutation-based parallelizable PRF
• Tight security bound of \textsf{2k-LightMAC\_Plus}

This page was built for publication: Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)

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