Application of the algebraic cryptanalysis method to the Kuznyechik encryption algorithm

Abdurakhimov, Bakhtiyor; Ilkhom, Boykuziev; Khudoykulov, Zarif; Allanov, Orif

doi:10.1109/icisct52966.2021.9670359

Cited by 6 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multiplication by an invertible diamatrix yields a diamatrix comprising multiple non-zero elements. These resultant values emerge from multiplication either by d 7 , an odd number, or by the residual sum from one of the terms in (4). Given that d 7 is odd and the entire term must be odd, the residual sum therein must be even.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

An application of SQUARE cryptanalysis to symmetric block cipher O'zDST 1105:2009 to retrieve secret parameters

Ikramov

2024

Preprint

View full text Add to dashboard Cite

We studied the symmetric block data encryption algorithm O'zDST 1105:2009 and demonstrated the process of retrieving of secret parameters $ R, d $ using integral analysis (SQUARE-analysis). These parameters are based on the secret key and are used to construct substitution tables of the algorithm. We attacked a truncated version of the algorithm exploiting its vulnerabilities. We demonstrated the importance of a thorough examination of the mutual influence of operations in encryption algorithms.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Abdurakhimov et al [4] analyzed algebraic attack on this algorithm in theory. They estimated the complexity of attack at 2 73 operations.…”

Section: Introductionmentioning

confidence: 99%

An application of SQUARE cryptanalysis to symmetric block cipher O'zDST 1105:2009 to retrieve secret parameters

Ikramov

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Natural Language Processing (NLP) [39], which mainly manipulates human language, has been applied in many tasks, such as in language translation and Chatbots. It can also be utilized in cryptanalysis [11,[40][41][42][43][44][45][46][47][48][49][50] to investigate the vulnerability of cryptographic algorithms used for text encryption. In [41], they recovered keys with a deep learning model from the ciphertexts encrypted with classical cryptographic algorithms, Caesar, Vigenère, and substitution cipher.…”

Section: Deep Learning-based Cryptanalysis On Text Datamentioning

confidence: 99%

“…The model with skip connection [24] was used for key prediction. In [48], they analyzed SM4 by recovering keys with MLPbased deep learning models, and the plaintexts, ciphertexts, and the keys used in the paper were generated by using a random number generator. In [49], they used an RNNbased deep learning model [51] to generate ciphertexts and recover plaintexts in small-PRESENT.…”

Section: Deep Learning-based Cryptanalysis On Text Datamentioning

confidence: 99%

Comprehensive Neural Cryptanalysis on Block Ciphers Using Different Encryption Methods

Jeong,

Ahmadzadeh,

Moon

2024

Mathematics

View full text Add to dashboard Cite

In this paper, we perform neural cryptanalysis on five block ciphers: Data Encryption Standard (DES), Simplified DES (SDES), Advanced Encryption Standard (AES), Simplified AES (SAES), and SPECK. The block ciphers are investigated on three different deep learning-based attacks, Encryption Emulation (EE), Plaintext Recovery (PR), Key Recovery (KR), and Ciphertext Classification (CC) attacks. The attacks attempt to break the block ciphers in various cases, such as different types of plaintexts (i.e., block-sized bit arrays and texts), different numbers of round functions and quantity of training data, different text encryption methods (i.e., Word-based Text Encryption (WTE) and Sentence-based Text Encryption (STE)), and different deep learning model architectures. As a result, the block ciphers can be vulnerable to EE and PR attacks using a large amount of training data, and STE can improve the strength of the block ciphers, unlike WTE, which shows almost the same classification accuracy as the plaintexts, especially in a CC attack. Moreover, especially in the KR attack, the Recurrent Neural Network (RNN)-based deep learning model shows higher average Bit Accuracy Probability than the fully connected-based deep learning model. Furthermore, the RNN-based deep learning model is more suitable than the transformer-based deep learning model in the CC attack. Besides, when the keys are the same as the plaintexts, the KR attack can perfectly break the block ciphers, even if the plaintexts are randomly generated. Additionally, we identify that DES and SPECK32/64 applying two round functions are more vulnerable than those applying the single round function by performing the KR attack with randomly generated keys and randomly generated single plaintext.

show abstract

“…Additionally, the integral cryptanalysis schemes have since been applied to various ciphers, including Hierocrypt [12], IDEA [13], Camellia [14], MISTY [15], and FOX [16] (now called IDEA NXT). In addition, an algebric cryptoanalysis method is also popular in cryptography and security as described in [5,17].…”

Section: Integral Cryptanalysis-based Encryptionmentioning

confidence: 99%

Integral cryptanalysis: a new key determination technique for 3-phase Kuznyechik encryption

et al. 2023

Self Cite

View full text Add to dashboard Cite

The primary objective of this work is to develop an algorithm for detecting the secret round key used in encryption by analyzing a collection of plaintexts and ciphertexts encrypted with the three-round Kuznyechik algorithm. In addition, the fundamentals of using the integral cryptanalysis method for the Substitution-permutation (SP) network-based Kuznyechik encryption have been investigated. It has been found that the Kuznyechik three-round encryption algorithm is useful for creating a balanced set before the third round and an unbalanced set at the end of the round, using a set in which the first byte is active and the remaining bytes are passive. Based on the findings above, an efficient algorithm to determine the key of the final round for the 3-round Kuznyechik algorithm is proposed utilizing the method of integral cryptanalysis. According to simulation results, the proposed approach offers approximately 90% improvement compared to baseline algorithms in terms of time complexity, data, and memory overhead.

show abstract

Application of the algebraic cryptanalysis method to the Kuznyechik encryption algorithm

Cited by 6 publications

References 5 publications

An application of SQUARE cryptanalysis to symmetric block cipher O'zDST 1105:2009 to retrieve secret parameters

An application of SQUARE cryptanalysis to symmetric block cipher O'zDST 1105:2009 to retrieve secret parameters

Comprehensive Neural Cryptanalysis on Block Ciphers Using Different Encryption Methods

Integral cryptanalysis: a new key determination technique for 3-phase Kuznyechik encryption

Contact Info

Product

Resources

About