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.
Original language | English |
---|---|
Title of host publication | Selected Areas in Cryptography – SAC 2018 |
Editors | Carlos Cid, Michael J. Jacobson |
Publisher | Springer |
Publication date | 1 Jan 2019 |
Pages | 115-138 |
ISBN (Print) | 9783030109691 |
DOIs | |
Publication status | Published - 1 Jan 2019 |
Event | 25th International Conference on Selected Areas in Cryptography - University of Calgary campus, Calgary, Canada Duration: 15 Aug 2018 → 17 Aug 2018 Conference number: 25 |
Conference
Conference | 25th International Conference on Selected Areas in Cryptography |
---|---|
Number | 25 |
Location | University of Calgary campus |
Country/Territory | Canada |
City | Calgary |
Period | 15/08/2018 → 17/08/2018 |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11349 LNCS |
ISSN | 0302-9743 |
Keywords
- Division property
- Integral attacks
- Tool