loading
Documentation
  • Login
  • Sign-Up

Research.Publish.Connect.

Paper

Authors: Nicolas T. Courtois 1 ; Pouyan Sepehrdad 2 ; Guangyan Song 1 and Iason Papapanagiotakis-Bousy 1

Affiliations: 1 University College London, United Kingdom ; 2 Qualcomm Inc., United States

ISBN: 978-989-758-196-0

Keyword(s): Cryptanalysis, Finite Fields, Polynomial Equations, Block Ciphers, NP-hard Problems, MQ Problem, Phase Transitions, XL Algorithm, Grobner Bases, ElimLin, Prediction, Time Series.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data and Application Security and Privacy ; Data Engineering ; Data Protection ; Databases and Data Security ; Information and Systems Security ; Security in Information Systems ; Security Requirements

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 do ne before. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SCITEPRESS user or Join INSTICC now for free.

Sign In SCITEPRESS user: please login.

Sign In INSTICC Members: please login. If not a member yet, Join INSTICC now for free.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.159.124.79. INSTICC members have higher download limits (free membership now)

In the current month:
Recent papers: 1 available of 1 total
2+ years older papers: 2 available of 2 total

Paper citation in several formats:
Courtois N., Sepehrdad P., Song G. and Papapanagiotakis-Bousy I. (2016). Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon.In Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 4: SECRYPT, (ICETE 2016) ISBN 978-989-758-196-0, pages 465-470. DOI: 10.5220/0005999504650470

@conference{secrypt16,
author={Nicolas T. Courtois and Pouyan Sepehrdad and Guangyan Song and Iason Papapanagiotakis-Bousy},
title={Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon},
booktitle={Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 4: SECRYPT, (ICETE 2016)},
year={2016},
pages={465-470},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005999504650470},
isbn={978-989-758-196-0},
}

TY - CONF

JO - Proceedings of the 13th International Joint Conference on e-Business and Telecommunications - Volume 4: SECRYPT, (ICETE 2016)
TI - Predicting Outcomes of ElimLin Attack on Lightweight Block Cipher Simon
SN - 978-989-758-196-0
AU - Courtois N.
AU - Sepehrdad P.
AU - Song G.
AU - Papapanagiotakis-Bousy I.
PY - 2016
SP - 465
EP - 470
DO - 10.5220/0005999504650470

Sorted by: Show papers

Note: The preferred Subjects/Areas/Topics, listed below for each paper, are those that match the selected paper topics and their ontology superclasses.
More...

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.

Show authors

Note: The preferred Subjects/Areas/Topics, listed below for each author, are those that more frequently used in the author's papers.
More...