UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon

Courtois, N; Song, G; Papapanagiotakis-Bousy, I; Sepehrdad, P; (2016) Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon. In: Proceedings of the 13th International Joint Conference on e-Business and Telecommunications. (pp. pp. 465-470). INSTICC: Portugal. Green open access

[img]
Preview
Text
Courtois_SECRYPT_2016_104.pdf - ["content_typename_Published version" not defined]

Download (248kB) | Preview

Abstract

There are two major families in cryptanalytic attacks on symmetric ciphers: statistical attacks and algebraic attacks. In this position paper we argue that algebraic cryptanalysis has not yet been developed properly due to the weakness of the theory which has substantial difficulty to prove most basic results on the number of linearly independent equations in algebraic attacks. Consequently most authors present a restricted range of attacks which are shown experimentally to work with their computer but refrain from claiming results which would work on a larger computer but have not yet been tested. For example in recent 2015 work of Raddum we discover that (experimentally) ElimLin attack breaks up to 16 rounds of Simon block cipher however it is hard to know what happens for 17 rounds. In this paper we argue that one CAN predict and model the behavior of such attacks and evaluate complexity of the attacks which we cannot yet execute. To the best of our knowledge this has never been done before.

Type: Proceedings paper
Title: Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon
Event: 13th International Joint Conference on e-Business and Telecommunications
Location: Lisbon, Portugal
Dates: 26 July 2016 - 28 July 2016
ISBN-13: 978-989-758-196-0
Open access status: An open access version is available from UCL Discovery
DOI: 10.5220/0005999504650470
Publisher version: http://dx.doi.org/10.5220/0005999504650470
Language: English
Additional information: This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Cryptanalysis, Finite Fields, Polynomial Equations, Block Ciphers, NP-hard Problems, MQ Problem, Phase Transitions, XL Algorithm, Grobner Bases, ElimLin, Prediction, Time Series
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1521419
Downloads since deposit
116Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item