Memoryless unbalanced meet-in-the-middle attacks: impossible results and applications

DOI10.1007/978-3-319-07536-5_16MaRDI QIDQ5168545zbMATH OpenOpenAlexFDO

Authors Yu Sasaki

Publication date 7 July 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07536-5_16

zbMATH Keywords

hash functionSHA-13-collisionFloyd's cycle-finding algorithmlimited-birthday distinguishermemoryless attackunbalanced meet-in-the-middle

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A new algorithm for the unbalanced meet-in-the-middle problem
• Improving implementable meet-in-the-middle attacks by orders of magnitude
• Memoryless near-collisions, revisited
• Faster Multicollisions
• Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks

Cited in

(3)

• Improving implementable meet-in-the-middle attacks by orders of magnitude
• A new algorithm for the unbalanced meet-in-the-middle problem
• Speeding up preimage and key-recovery attacks with highly biased differential-linear approximations

This page was built for publication: Memoryless unbalanced meet-in-the-middle attacks: impossible results and applications

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