Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310

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 and systematic exploration is not possible. The main question i...

Full description

Saved in:

Bibliographic Details
Published in:	Cryptologia Vol. 44; no. 1; pp. 20 - 38
Main Authors:	Courtois, Nicolas T., Georgiou, Marios
Format:	Journal Article
Language:	English
Published:	West Point Taylor & Francis 02.01.2020 Taylor & Francis Inc
Subjects:	algebraic cryptanalysis Algorithms ANF backdoors Boolean functions ciphertext-only attacks Circuits Cold War Complexity Cryptography Encryption Feistel ciphers generalized linear cryptanalysis higher-order correlation attacks history I/O sums Invariants Mathematical analysis modern block ciphers multivariate polynomials partitioning cryptanalysis polynomial invariants Polynomials T-310 weak keys
ISSN:	0161-1194, 1558-1586
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!