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

DOI10.3934/AMC.2023025zbMATH Open1547.94357MaRDI QIDQ6605894FDOQ6605894

Authors: Avijit Dutta, Mridul Nandi, Suprita Talnikar 

Publication date: 16 September 2024

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11)

Cites Work

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

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)