Application of the distinguishing attack to lightweight block ciphers

Boris Ryabko, Aleksandr Soskov

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

1 Citation (Scopus)

Abstract

By definition, a distinguishing attack is any test that allows distinguishing the encrypted data from random data and modern symmetric-key ciphers must be immune to such an attack. In other words, modern block ciphers are designed to have ciphertext indistinguishability. If an algorithm that can distinguish the cipher output from random faster than a brute force search is found, then that is considered a break of the cipher. We applied the distinguishing attack to modern lightweight block ciphers Speck, Simon, Simeck, HIGHT and LEA using statistical test 'Book Stack'. We experimentally found a minimal number of rounds where encrypted data looked like random bit-sequence. It is shown, that this number of rounds varies significantly for different ciphers. In particular, our experiments and estimations show that cipher Simeck48/96 is not immune to distinguishing attack.

Original languageEnglish
Title of host publicationProceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages338-341
Number of pages4
ISBN (Electronic)9781538615966
DOIs
Publication statusPublished - 14 Nov 2017
Event2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 - Novosibirsk, Russian Federation
Duration: 18 Sep 201722 Sep 2017

Conference

Conference2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
CountryRussian Federation
CityNovosibirsk
Period18.09.201722.09.2017

Fingerprint

Dive into the research topics of 'Application of the distinguishing attack to lightweight block ciphers'. Together they form a unique fingerprint.

Cite this