Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512

Akshima,; Chang, Donghoon; Ghosh, Mohona; Goel, Aarushi; Sanadhya, Somitra Kumar

doi:10.1007/978-3-319-30840-1_8

Cited by 3 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This research might be useful for the improvement of various methods of information security, as well as other practical use [45][46][47][48][49][50][51][52]. In particular, the obtained results can be used to build non-linear replacement nodes for modern block symmetric ciphers, including the formation of sblocks of the Ukrainian national block encryption standard Kalyna (DSTU 7624: 2014) [3,53], the cryptographic hashing algorithm Kupyna [54][55][56], as well as the recently approved stream encryption standard Strumok [16].…”

Section: Prospects For Further Researchmentioning

confidence: 99%

Heuristic Methods for the Design of Cryptographic Boolean Functions

Moskovchenko¹,

Кuznetsov²,

Kavun³

et al. 2019

IJC

View full text Add to dashboard Cite

In this article, heuristic methods of hill climbing for cryptographic Boolean functions satisfying the required properties of balance, nonlinearity, autocorrelation, and other stability indicators are considered. A technique for estimating the computational efficiency of gradient search methods, based on the construction of selective (empirical) distribution functions characterizing the probability of the formation of Boolean functions with indices of stability not lower than required, is proposed. As an indicator of computational efficiency, an average number of attempts is proposed to be performed using a heuristic method to form a cryptographic Boolean function with the required properties. Comparative assessments of the effectiveness of the heuristic methods are considered. The results of investigations of the cryptographic properties of the formed Boolean functions in comparison with the best known assessments are given. On the basis of the conducted research, it can be concluded that the functions constructed in accordance with the developed method have high persistence indexes and exceed the known functions by these indicators.

show abstract

Section: Prospects For Further Researchmentioning

confidence: 99%

Heuristic Methods for the Design of Cryptographic Boolean Functions

Moskovchenko¹,

Кuznetsov²,

Kavun³

et al. 2019

IJC

View full text Add to dashboard Cite

show abstract

“…The combined probability for these linear approximations is calculated using the pilingup lemma introduced by Matsui in [2].…”

Section: Linear Probability Estimationsmentioning

confidence: 99%

“…There are various extensions to classical linear cryptanalysis that aims as well to reduce the complexity or improve the attack by recovering more key bits. One example is using multiple linear approximations to obtain more information about the key bits [11], [9], [2], [10], [4].…”

Section: Key Recovery In Complexity Datamentioning

confidence: 99%

“…These results were improved in multidimensional linear attacks because they involve many key, several key bits of K can be derived at the same time [1], [10].…”

Section: Key Recovery In Complexity Datamentioning

confidence: 99%

“…Linearity tests on various max. Terms is applied to get a linear super poly, this is referred to as cube testers [2]. Cube attacks work well for polynomials of low degrees.…”

Section: Cube Attacksmentioning

confidence: 99%

See 2 more Smart Citations

A Brief Review on Methodology of Cryptanalysis

2019

View full text Add to dashboard Cite

Cryptanalysis comes into deferent forms in order to support that rigorous analysis of the structure cryptographic primitive to evaluate and verify its claimed security margins. This analysis will follow the attack models represented previously in order to exploit possible weakness in the primitive. Thus, achieving the associated attack goals which will vary from a distinguishing attack to a total break that is deﬁned based on the security margins or claims of the primitive under study. For example, for a hash function, total break constitutes ﬁnding a collision or obtaining the message from the hash value. While in block ciphers it revolves around recovering the secret key. When it comes to the claimed security margins, the design approaches will follow certain security models as in provable security or practical security or a mixture of both. The role of cryptanalyst is to subject these primitives to diﬀerent existing categories of cryptanalysis approaches and tailor new ones that will push the design’s security margins if possible to new limits where these attacks are not applicable any more This chapter will introduce the prominent methods of cryptanalysis that utilize certain behavior in the cipher structure. Such behavior disturbs the assumed randomness of the output or the cipher text. This Paper will explore the basic deﬁnitions of prominent cryptanalysis methods that targets the speciﬁc structure of a cipher namely diﬀerential and linear cryptanalysis and their diﬀerent variants. It will also discuss other potential crytpanalytic methods that are usually used in symmetric-key ciphers analysis especially block ciphers.

show abstract