Forgery and subkey recovery on CAESAR candidate iFeed

DOI10.1007/978-3-319-31301-6_11zbMATH Open1396.94099OpenAlexW2467108772MaRDI QIDQ2807205FDOQ2807205

Authors: Willem Schroé, Bart Mennink, E. A. Andreeva, Bart Preneel 

Publication date: 19 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_11

Recommendations

• Reforgeability of authenticated encryption schemes
• Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks
• Forgery Attacks on Round-Reduced ICEPOLE-128
• Cryptanalysis of \texttt{NORX} v2.0
• Forgery attacks on FlexAE and FlexAEAD

zbMATH Keywords

forgeryCAESARbreaking forward secrecyiFeedsubkey recovery

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• How to securely release unverified plaintext in authenticated encryption

Cited In (4)

• Blockcipher-based authenticated encryption: how small can we go?
• Universal forgery and key recovery attacks on ELmD authenticated encryption algorithm
• Reforgeability of authenticated encryption schemes
• Cryptanalysis of OCB2: attacks on authenticity and confidentiality

This page was built for publication: Forgery and subkey recovery on CAESAR candidate iFeed

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