This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2 120 to 2 112.
CITATION STYLE
Sasaki, Y. (2018). Integer Linear Programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11049 LNCS, pp. 227–243). Springer Verlag. https://doi.org/10.1007/978-3-319-97916-8_15
Mendeley helps you to discover research relevant for your work.