Paper 2020/523

Generalized Matsui Algorithm 1 with application for the full DES

Tomer Ashur, Raluca Posteuca, Danilo Šijačić, and Stef D’haeseleer

Abstract

In this paper we introduce the strictly zero-correlation attack. We extend the work of Ashur and Posteuca in BalkanCryptSec 2018 and build a 0-correlation key-dependent linear trails covering the full DES. We show how this approximation can be used for a key recovery attack and empirically verify our claims through a series of experiments. To the best of our knowledge, this paper is the first to use this kind of property to leverage a meaningful attack against a symmetric-key algorithm.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. 12TH CONFERENCE ON SECURITY AND CRYPTOGRAPHY FOR NETWORKS (SCN 2020)
Keywords
linear cryptanalysisDESpoisonous hul
Contact author(s)
Tomer Ashur @ esat kuleuven be
Raluca Posteuca @ esat kuleuven be
History
2020-10-08: last of 2 revisions
2020-05-05: received
See all versions
Short URL
https://ia.cr/2020/523
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/523,
      author = {Tomer Ashur and Raluca Posteuca and Danilo Šijačić and Stef D’haeseleer},
      title = {Generalized Matsui Algorithm 1 with application for the full {DES}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/523},
      year = {2020},
      url = {https://eprint.iacr.org/2020/523}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.