Modeling of Algebraic Analysis of GOST+ Cipher in SageMath
Title | Modeling of Algebraic Analysis of GOST+ Cipher in SageMath |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Babenko, Ludmila, Maro, Ekaterina, Anikeev, Maxim |
Conference Name | Proceedings of the 9th International Conference on Security of Information and Networks |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-4764-8 |
Keywords | Algebraic cryptanalysis, CryptoMiniSat, GOST⌖, Lightweight Ciphers, pubcrawl, Resiliency, SageMath, SAT |
Abstract | In this paper we present results of algebraic analysis of GOST algorithm in SageMath environment. Using the GOST as the example we explore basic stages of algebraic analysis of any symmetric block cipher based on Feistel network. We construct sets of boolean equations for five encryption rounds and determine the number of known text pairs for which the key can be found with the probability of 1. The algebraic analysis of five rounds of GOST allowed to find a 160-bit encryption key with the probability of 1 for five known text pairs within 797.21 s; the search for the solution took 24.66 s. |
URL | http://doi.acm.org/10.1145/2947626.2947656 |
DOI | 10.1145/2947626.2947656 |
Citation Key | babenko_modeling_2016 |