\textsf{LightMAC}: fork it and make it faster

DOI10.3934/AMC.2022100MaRDI QIDQ6584328zbMATH OpenFDO

Authors Nilanjan Datta, Avijit Dutta, Cuauhtemoc Mancillas-López

Publication date 6 August 2024

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

Full work available at URL https://doi.org/10.3934/AMC.2022100

zbMATH Keywords

forkcipherH-coefficientprovable securityreset-sampling techniquesymmetric-key cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• Improved security bound of LightMAC\_Plus and its single-key variant
• Tight security bound of \textsf{2k-LightMAC\_Plus}
• Blockcipher-based MACs: beyond the birthday bound without message length
• A MAC mode for lightweight block ciphers

Cites work

• A MAC mode for lightweight block ciphers
• A New Look at Counters: Don’t Run Like Marathon in a Hundred Meter Race
• A new variant of PMAC: beyond the birthday bound
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Advances in Cryptology - CRYPTO 2003
• Blockcipher-based MACs: beyond the birthday bound without message length
• Cryptanalysis of ForkAES
• Feistel ciphers. Security proofs and cryptanalysis
• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• Forkcipher: a new primitive for authenticated encryption of very short messages
• How to stretch random functions: The security of protected counter sums
• scientific article; zbMATH DE number 1303128 (Why is no real title available?)
• scientific article; zbMATH DE number 1030978 (Why is no real title available?)
• scientific article; zbMATH DE number 1759779 (Why is no real title available?)
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• Improved security bound of LightMAC\_Plus and its single-key variant
• Information-theoretic indistinguishability via the chi-squared method
• Nonce-misuse security of the SAEF authenticated encryption mode
• OMAC: one-key CBC MAC.
• On the provable security of the iterated Even-Mansour cipher against related-key and chosen-key attacks
• PMAC with parity: minimizing the query-length influence
• Progress in Cryptology - INDOCRYPT 2004
• Proof of Mirror Theory for ξ _max = 2
• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
• Square attack on 7-round Kiasu-BC
• The indistinguishability of the XOR of k permutations
• The security of the cipher block chaining message authentication code
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• The sum of CBC MACs is a secure PRF
• The sum of PRPs is a secure PRF
• The “Coefficients H” Technique
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework

Cited in

(3)

• Tight security bound of \textsf{2k-LightMAC\_Plus}
• Tweakable ForkCipher from ideal block cipher
• Multi user security of \textsf{LightMAC} and \textsf{LightMAC\_Plus}

This page was built for publication: \textsf{LightMAC}: fork it and make it faster

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