Finding Integral Distinguishers with Ease

Zahra Eskandari; Andreas Brasen Kidmose; Stefan Kölbl; Tyge Tiessen

doi:10.1007/978-3-030-10970-7_6

Finding Integral Distinguishers with Ease

Zahra Eskandari, Andreas Brasen Kidmose, Stefan Kölbl^*, Tyge Tiessen

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

19 Downloads (Pure)

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	https://doi.org/10.1007/978-3-030-10970-7_6
Publication status	Published - 1 Jan 2019
Event	25th International Conference on Selected Areas in Cryptography, SAC 2018 - Calgary, Canada Duration: 15 Aug 2018 → 17 Aug 2018

Conference

Conference	25th International Conference on Selected Areas in Cryptography, SAC 2018
Country	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

Access to Document

10.1007/978-3-030-10970-7_6

FulltextAccepted author manuscript, 494 KB

Cite this

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

Eskandari, Zahra ; Kidmose, Andreas Brasen ; Kölbl, Stefan ; Tiessen, Tyge. / Finding Integral Distinguishers with Ease. Selected Areas in Cryptography – SAC 2018 . editor / Carlos Cid ; Michael J. Jacobson. Springer, 2019. pp. 115-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11349 LNCS).

@inproceedings{89ad3d1fe16748b3a4ffedcbb9c47c93,

title = "Finding Integral Distinguishers with Ease",

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.",

keywords = "Division property, Integral attacks, Tool",

author = "Zahra Eskandari and Kidmose, {Andreas Brasen} and Stefan K{\"o}lbl and Tyge Tiessen",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-10970-7_6",

language = "English",

isbn = "9783030109691",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "115--138",

editor = "Carlos Cid and Jacobson, {Michael J.}",

booktitle = "Selected Areas in Cryptography – SAC 2018",

note = "25th International Conference on Selected Areas in Cryptography, SAC 2018 ; Conference date: 15-08-2018 Through 17-08-2018",

}

Eskandari, Z, Kidmose, AB, Kölbl, S & Tiessen, T 2019, Finding Integral Distinguishers with Ease. in C Cid & MJ Jacobson (eds), Selected Areas in Cryptography – SAC 2018 . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11349 LNCS, pp. 115-138, 25th International Conference on Selected Areas in Cryptography, SAC 2018, Calgary, Canada, 15/08/2018. https://doi.org/10.1007/978-3-030-10970-7_6

Finding Integral Distinguishers with Ease. / Eskandari, Zahra; Kidmose, Andreas Brasen; Kölbl, Stefan; Tiessen, Tyge.

Selected Areas in Cryptography – SAC 2018 . ed. / Carlos Cid; Michael J. Jacobson. Springer, 2019. p. 115-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11349 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Finding Integral Distinguishers with Ease

AU - Eskandari, Zahra

AU - Kidmose, Andreas Brasen

AU - Kölbl, Stefan

AU - Tiessen, Tyge

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Division property

KW - Integral attacks

KW - Tool

U2 - 10.1007/978-3-030-10970-7_6

DO - 10.1007/978-3-030-10970-7_6

M3 - Article in proceedings

AN - SCOPUS:85060711382

SN - 9783030109691

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 115

EP - 138

BT - Selected Areas in Cryptography – SAC 2018

A2 - Cid, Carlos

A2 - Jacobson, Michael J.

PB - Springer

T2 - 25th International Conference on Selected Areas in Cryptography, SAC 2018

Y2 - 15 August 2018 through 17 August 2018

ER -

Eskandari Z, Kidmose AB, Kölbl S, Tiessen T. Finding Integral Distinguishers with Ease. In Cid C, Jacobson MJ, editors, Selected Areas in Cryptography – SAC 2018 . Springer. 2019. p. 115-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 11349 LNCS). https://doi.org/10.1007/978-3-030-10970-7_6