Paper 2013/634
Improved Linear Sieving Techniques with Applications to Step-Reduced LED-64
Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir
Abstract
In this paper, we describe new techniques in meet-in-the-middle attacks. Our basic technique is called a \emph{linear key sieve} since it exploits as filtering conditions linear dependencies between key bits that are guessed from both sides of the attack. This should be contrasted with related previous attacks, which only exploited
a \emph{linear state sieve} (i.e., linear dependencies between state bits that are computed from
both sides of the attack). We apply these techniques to the lightweight block cipher LED-64, and improve some of the best known attacks on step-reduced variants of this cipher in all attack models. As a first application of the linear key sieve, we describe a chosen plaintext attack on 2-step LED-64, which reduces the time complexity of the
best previously published attack on this variant from
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- CryptanalysisLEDAESEven-MansourMeet-in-the-middle attackSplice-and-cut
- Contact author(s)
- dinur @ di ens fr
- History
- 2013-10-05: received
- Short URL
- https://ia.cr/2013/634
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/634, author = {Itai Dinur and Orr Dunkelman and Nathan Keller and Adi Shamir}, title = {Improved Linear Sieving Techniques with Applications to Step-Reduced {LED}-64}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/634}, year = {2013}, url = {https://eprint.iacr.org/2013/634} }