Visible to the public How to Exploit Biham-Keller ID Characteristic to Minimize Data

TitleHow to Exploit Biham-Keller ID Characteristic to Minimize Data
Publication TypeConference Paper
Year of Publication2022
AuthorsKara, Orhun
Conference Name2022 15th International Conference on Information Security and Cryptography (ISCTURKEY)
Date Publishedoct
KeywordsAES, Biham-Keller ID characteristic, Block Cipher, Complexity theory, composability, cryptography, IDS, impossible differential attack, impossible differential characteristic, Information security, pubcrawl, resilience, Resiliency, Schedules, SPN cipher
AbstractIn this work, we examine the following question: How can we improve the best data complexity among the impossible differential (ID) attacks on AES? One of the most efficient attacks on AES are ID attacks. We have seen that the Biham-Keller ID characteristics are frequently used in these ID attacks. We observe the following fact: The probability that a given pair with a wrong key produce an ID characteristic is closely correlated to the data usage negatively. So, we maximize this probability by exploiting a Biham-Keller ID characteristic in a different manner than the other attacks. As a result, we mount an ID attack on 7-round AES-192 and obtain the best data requirement among all the ID attacks on 7-round AES. We make use of only 2$^\textrm58$ chosen plaintexts.
DOI10.1109/ISCTURKEY56345.2022.9931847
Citation Keykara_how_2022