Algebraic Cryptanalysis of Block Ciphers

DOI

10.2991/wcnme-19.2019.30How to use a DOI?

Keywords

algebraic cryptanalysis; linearization; S-block; residual variables; equation systems; truth tables; Boolean function; Zhegalkin polynomial

Abstract

Algebraic methods of cryptanalysis are applicable to present-day ciphers. These methods are based on generation of an equation system, where elements of a ciphertext and a key are chosen as variables of the system. When implementing a linearization method to solve the equation system, we consider a possibility to find partial elements of a key. Generally, cryptosystems use S-blocks, which are the only element contributing to nonlinearity of a ciphering transformation and the level of its strength against cryptanalytic attacks. In this paper we present, by the example of encryption algorithm Kuznechik, an algebraic analysis applicable to some block ciphers.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Rustem Biyashev
AU  - Dilmuhanbet Dyusenbayev
AU  - Kunbolat Algazy
AU  - Nursulu Kapalova
PY  - 2019/06
DA  - 2019/06
TI  - Algebraic Cryptanalysis of Block Ciphers
BT  - Proceedings of the 2019 International Conference on Wireless Communication, Network and Multimedia Engineering (WCNME 2019)
PB  - Atlantis Press
SP  - 129
EP  - 132
SN  - 2352-538X
UR  - https://doi.org/10.2991/wcnme-19.2019.30
DO  - 10.2991/wcnme-19.2019.30
ID  - Biyashev2019/06
ER  -