research-article

Linear and Differential Analysis of Simplified Kuznyechik Cipher

Authors:

Evgeniya Ishchukova,

Vyacheslav Salmanov,

Oksana ShamilyanAuthors Info & Claims

SIN '18: Proceedings of the 11th International Conference on Security of Information and Networks

Article No.: 14, Pages 1 - 6

https://doi.org/10.1145/3264437.3264490

Published: 10 September 2018 Publication History

Abstract

We presented a paper with the description of simplified Kuznyechik ciphers at SIN 2017 conference previous year [9]. We introduced two ciphers in [9]. The first one was designed for teaching general principles of Kuznyechik. The second one was designed for modeling different attacks in order to understand which ones need more research with regard to original Kuznyechik. In this paper we propose to consider the approaches of linear and differential cryptanalysis to the second simplified version. In order to achieve this, we investigate linear and differential properties of the cipher and find their particular features. We present an algorithm of building multi-round characteristics that engage as many non-zero blocks as possible for the differential analysis. As to the linear cryptanalysis, we consider possible ways to build efficient linear statistical analogs. We find maximal possible number of rounds for which the considered attacks are applicable.

References

[1]

Eli Biham and Adi Shamir. 1991. Differential cryptanalysis of DES-like cryptosystems. Journal of CRYPTOLOGY 4, 1 (1991), 3--72.

Digital Library

[2]

Eli Biham and Adi Shamir. 1992. Differential cryptanalysis of the full 16-round DES. In Annual International Cryptology Conference. Springer, 487--496.

Digital Library

[3]

Samantha Campbell, Max Grinchenko, and William Smith. 2013. Linear cryptanalysis of simplified AES under change of S-Box. Cryptologia 37, 2 (2013), 120--138.

Digital Library

[4]

Kamil Dworak and Urszula Boryczka. 2015. Cryptanalysis of SDES using modified version of binary particle swarm optimization. In Computational Collective Intelligence. Springer, 159--168.

[5]

Henri Gilbert. 2014. A simplified representation of AES. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 200--222.

[6]

Howard M Heys. 2002. A tutorial on linear and differential cryptanalysis. Cryptologia 26, 3 (2002), 189--221.

Digital Library

[7]

Bara Hitapuru and Santi Indarjani. 2016. Square attack on Mini-AES and Simplified AES using all variants of active nibble position. In AIP Conference Proceedings, Vol. 1729. AIP Publishing, 020007.

[8]

Evgeniya Ishchukova, Ludmila Babenko, and Maxim Anikeev. 2016. Fast Implementation and Cryptanalysis of GOST R 34.12-2015 Block Ciphers. In Proceedings of the 9th International Conference on Security of Information and Networks (SIN '16). ACM, New York, NY, USA, 104--111.

Digital Library

[9]

Evgeniya Ishchukova, Ludmila Babenko, and Maxim Anikeev. 2017. Two Simplified Versions of Kuznyechik Cipher (GOST R 34.12-2015). In Proceedings of the 10th International Conference on Security of Information and Networks (SIN '17). ACM, New York, NY, USA, 287--290.

Digital Library

[10]

S Davood Mansoori and H Khaleghei Bizaki. 2007. On the vulnerability of simplified AES algorithm against linear cryptanalysis. Int. J. Comp. Sci. Network Security 7, 7 (2007), 257--263.

[11]

Mitsuru Matsui. 1993. Linear cryptanalysis method for DES cipher. In Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 386--397.

Digital Library

[12]

Mohammad A Musa, Edward F Schaefer, and Stephen Wedig. 2003. A simplified AES algorithm and its linear and differential cryptanalyses. Cryptologia 27, 2 (2003), 148--177.

[13]

N Nalini and G Raghavendra Rao. 2005. Cryptanalysis of simplified data encryption standard via optimization heuristics. In Intelligent Sensing and Information Processing, 2005. ICISIP 2005. Third International Conference on. IEEE, 74--79.

Digital Library

[14]

Federal Agency on Technical Regulation and Metrology. 2015. GOST R 34.12-2015 "Information technology. Cryptographic data security. Block ciphers.". Moscow. http://tc26.ru/en/standard/gost/GOST_R_34_12_2015_ENG.pdf

[15]

KS Ooi and Brain Chin Vito. 2002. Cryptanalysis of S-DES. IACR Cryptology ePrint Archive 2002 (2002), 45.

[16]

Raphael Chung-Wei Phan. 2002. Mini advanced encryption standard (mini-AES): a testbed for cryptanalysis students. Cryptologia 26, 4 (2002), 283--306.

[17]

Raphael Chung-Wei Phan. 2003. Impossible differential cryptanalysis of Mini-AES. Cryptologia 27, 4 (2003), 361--374.

[18]

Rajashekarappa, KM Sunjiv Soyjaudah, and Sumitra Devi KA. 2013. Overview of Linear Cryptanalysis on S-DES and Block Ciphers using Hill Cipher Method. International Journal of Computer Applications 63, 21 (2013).

[19]

Sean Simmons. 2009. Algebraic Cryptanalysis of Simplified AESâĹ&Uring;. Cryptologia 33, 4 (2009), 305--314.

[20]

William Stallings. 1998. Cryptography and network security: principles and practice. Prentice Hall. 562 pages.

Digital Library

[21]

R Vimalathithan and ML Valarmathi. 2009. Cryptanalysis of S-DES using Genetic Algorithm. International Journal of Recent Trends in Engineering 2, 4 (2009), 76--79.

Cited By

Mubarok MIndarjani S(2023)A Linear Cryptanalysis On Simplified Kuznyechik 22023 IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs)10.1109/ICoCICs58778.2023.10276968(173-177)Online publication date: 22-Aug-2023
https://doi.org/10.1109/ICoCICs58778.2023.10276968

Index Terms

Linear and Differential Analysis of Simplified Kuznyechik Cipher
1. Security and privacy
  1. Cryptography
    1. Cryptanalysis and other attacks
    2. Symmetric cryptography and hash functions
      1. Block and stream ciphers
2. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
        Computer science education

Recommendations

Two simplified versions of Kuznyechik cipher (GOST R 34.12-2015)
SIN '17: Proceedings of the 10th International Conference on Security of Information and Networks

Kuznyechik cipher is a new symmetric block cipher declared as a state standard in Russian Federation. The cipher is based on SP (Substitution Permutation) network principle, the block size is 128 bits, the key size is 256 bits, and encryption takes nine ...
A methodology for differential-linear cryptanalysis and its applications
FSE'12: Proceedings of the 19th international conference on Fast Software Encryption

In 1994 Langford and Hellman introduced a combination of differential and linear cryptanalysis under two default independence assumptions, known as differential-linear cryptanalysis, which is based on the use of a differential-linear distinguisher ...
Differential attack on nine rounds of the SEED block cipher

The SEED block cipher has a 128-bit block length, a 128-bit user key and a total number of 16 rounds. It is an ISO international standard. In this letter, we describe two 7-round differentials with a trivially larger probability than the best previously ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

SIN '18: Proceedings of the 11th International Conference on Security of Information and Networks

September 2018

148 pages

ISBN:9781450366083

DOI:10.1145/3264437

Conference Chairs:
Pete Burnap
Cardiff University, UK
,
Atilla Elçi
Aksaray Univeristy, Turkey
,
Omer Rana
Cardiff University, UK
,
Program Chairs:
Philipp Reinecke
Cardiff University, UK
,
Naghmeh Moradpoor
Edinburgh Napier University, UK
,
George Theodorakopoulos
Cardiff University, UK
,
Koray Karabina
Florida Atlantic University, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Cardiff University: Cardiff University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 September 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Russian Foundation for Basic Research

Conference

SIN '18

SIN '18: 11th International Conference On Security Of Information and Networks

September 10 - 12, 2018

Cardiff, United Kingdom

Acceptance Rates

SIN '18 Paper Acceptance Rate 24 of 42 submissions, 57%;

Overall Acceptance Rate 102 of 289 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
87
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mubarok MIndarjani S(2023)A Linear Cryptanalysis On Simplified Kuznyechik 22023 IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs)10.1109/ICoCICs58778.2023.10276968(173-177)Online publication date: 22-Aug-2023
https://doi.org/10.1109/ICoCICs58778.2023.10276968

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents