Courtois, NT;
Georgiou, M;
(2020)
Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310.
Cryptologia
, 44
(1)
pp. 20-38.
10.1080/01611194.2019.1650845.
Preview |
Text
cycling_myst_constr_part1.pdf - Accepted Version Download (2MB) | Preview |
Abstract
One of the major open problems in symmetric cryptanalysis is to discover new specific types of invariant properties for block ciphers. In this article, we study nonlinear polynomial invariant attacks. The number of such attacks grows as 22n and systematic exploration is not possible. The main question is HOW do we find such attacks? We have developed a constructive algebraic approach that is about making sure that a certain combination of polynomial equations is zero. We work by progressive elimination of specific variables in polynomial spaces and we show that one can totally eliminate big chunks of the cipher circuit. As an application, we present several new attacks on the historical T-310 block cipher that has particularly large hardware complexity and a very large number of rounds compared with modern ciphers, e.g., AES. However, all this complexity is not that useful if we are able to construct new types of polynomial invariant attacks that work for any number of rounds.
| Type: | Article |
|---|---|
| Title: | Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1080/01611194.2019.1650845 |
| Publisher version: | https://doi.org/10.1080/01611194.2019.1650845 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | algebraic cryptanalysis, ANF, backdoors, Boolean functions, ciphertext-only attacks, Cold War, Feistel ciphers, generalized linear cryptanalysis, higher-order correlation attacks, history, I/O sums, modern block ciphers, multivariate polynomials, partitioning cryptanalysis, polynomial invariants, T-310, weak keys |
| UCL classification: | UCL 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: | https://discovery.ucl.ac.uk/id/eprint/10133692 |
Archive Staff Only
 |
View Item |
