Low-Data Complexity Attacks on AES

DOI10.1109/TIT.2012.2207880MaRDI QIDQ2989725zbMATH OpenOpenAlexFDO

Authors Charles Bouillaguet, Patrick Derbez, Orr Dunkelman, Pierre-Alain Fouque, Nathan Keller, Vincent Rijmen

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2012.2207880

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(14)

• SCA-resistance for AES: how cheap can we go?
• Cryptanalysis of the stream cipher LEX
• Exhausting Dmirci-Selçuk meet-in-the-middle attacks against reduced-round AES
• A higher order key partitioning attack with application to LBlock
• Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
• A Probing Attack on AES
• ОБЗОР АТАК НА AES-128: К ПЯТНАДЦАТИЛЕТИЮ СТАНДАРТА AES
• Adapting Density Attacks to Low-Weight Knapsacks
• Improved key recovery attacks on reduced-round AES with practical data and memory complexities
• New attacks on LowMC instances with a single plaintext/ciphertext pair
• Meet-in-the-middle attacks on AES with value constraints
• Scrutinizing the security of AES-based hashing and one-way functions
• Triangulating meet-in-the-middle attack
• The parallel-cut meet-in-the-middle attack

This page was built for publication: Low-Data Complexity Attacks on AES

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