Finding Integral Distinguishers with Ease

26Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The division property method is a technique to determine integral distinguishers on block ciphers. While the complexity of finding these distinguishers is higher, it has recently been shown that MILP and SAT solvers can efficiently find such distinguishers. In this paper, we provide a framework to automatically find those distinguishers which solely requires a description of the cryptographic primitive. We demonstrate that by finding integral distinguishers for 30 primitives with different design strategies. We provide several new or improved bit-based division property distinguishers for ChaCha, Chaskey, DES, GIFT, LBlock, Mantis, Qarma, RoadRunner, Salsa and SM4. Furthermore, we present an algorithm to find distinguishers with lower data complexity more efficiently.

Cite

CITATION STYLE

APA

Eskandari, Z., Kidmose, A. B., Kölbl, S., & Tiessen, T. (2019). Finding Integral Distinguishers with Ease. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11349 LNCS, pp. 115–138). Springer Verlag. https://doi.org/10.1007/978-3-030-10970-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free