Improved security analysis of PMAC
From MaRDI portal
Publication:3537520
DOI10.1515/JMC.2008.007zbMATH Open1146.94009OpenAlexW2024310614MaRDI QIDQ3537520FDOQ3537520
Authors: Mridul Nandi, Avradip Mandal
Publication date: 7 November 2008
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc.2008.007
Recommendations
Cites Work
Cited In (16)
- Fine-tuning the ISO/IEC standard \textsf{LightMAC}
- PMAC with parity: minimizing the query-length influence
- Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
- Improved security analysis for OMAC as a pseudorandom function
- Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
- New Bounds for PMAC, TMAC, and XCBC
- On the influence of message length in PMAC's security bounds
- Generalizing PMAC under weaker assumptions
- A MAC mode for lightweight block ciphers
- An updated security analysis of PFLASH
- A lightweight alternative to PMAC
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}
- Forgery and Key Recovery Attacks on PMAC and Mitchell’s TMAC Variant
- Multi-user BBB security of public permutations based MAC
- A new variant of PMAC: beyond the birthday bound
This page was built for publication: Improved security analysis of PMAC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537520)