Analysis of affinely equivalent Boolean functions

Meng, Qiang; Zhang, Huanguo; Yang, Min; Wang, ZhangYi

doi:10.1007/s11432-007-0030-9

Cited by 13 publications

(15 citation statements)

References 12 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, as early as in 2004, Clark on the analysis of the status and progress of the cryptology evolution do an analysis and discussion of the system, and pointed out that the analysis of the evolution of modern cryptography will be a very difficult, long-term task [17,22,23,24].…”

Section: Cryptology Evolution Analysis Of the Development Trend Of Thmentioning

confidence: 99%

A Cryptanalysis Method based on Niche Genetic Algorithm

Li¹,

Li²,

Zhang³

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

At present, the evolution cryptanalysis methods mainly adopt the basic genetic algorithm (literature [1] and [2]) which has "early" phenomenon, searching stagnation in the near optimal solution, and low calculation efficiency. This paper inspired by biological genetic evolution proposes a niche genetic algorithm based on the code analysis method. This algorithm can keep the population diversity and prevent premature convergence. In genetic operator operation, this algorithm uses (µ + λ ) selection strategy which has the strongest selection pressure. In order to achieve compensating the shortage of groups diversity easy loss, improve the searching efficiency of algorithm, speed up the convergence speed, this algorithm applies the multi-point crossover operation, at the same time adopts variation operation by introducing evolution mutation probability. This paper chooses examples to demonstrate the replace cryptogram. Experiments show that the algorithm can effectively reduce the complexity of the problem analysis, reduce the redundant computation, speed up the convergence. Therefore, in the limited time, it can effectively get an optimal solution or suboptimal solution of the analysis object.

show abstract

Section: Cryptology Evolution Analysis Of the Development Trend Of Thmentioning

confidence: 99%

A Cryptanalysis Method based on Niche Genetic Algorithm

Li¹,

Li²,

Zhang³

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…The capability for the attacker to intercept data is almost the same for every time period T /t, i.e., the attacker will get N/t plaintext-ciphertext pairs in every time period T /t. 5. For each block cipher E i , i = 0, 1, .…”

Section: The Evolutionary Cryptosystem Against Differential Cryptanalmentioning

confidence: 99%

“…The evolutionary DES with more cryptographically robust S-boxes related to differential cryptanalysis and linear cryptanalysis was presented in [1,2]. Utilizing the evolutionary algorithm, Meng et al [4][5][6] gave some new results in construction and affinely inequivalent classification of Bent functions in small variables. Wang [7] presented a novel algorithm for producing Hash-function with high security level, high efficiency and ideal randomness.…”

Section: Introductionmentioning

confidence: 99%

Capability of evolutionary cryptosystems against differential cryptanalysis

Zhang

Tang

2011

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

The evolutionary cryptosystem is a new cryptosystem. This paper studies its security level resisting against differential cryptanalysis. It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem against differential cryptanalysis. On the basis of the relationship among the data complexity, the bit advantage and the success rate of differential cryptanalysis, it is proven that more data is needed for attacking the evolutionary cryptosystem when the bit advantage and success rate are identical. Moreover, it is shown that the time complexity for attacking the evolutionary cryptosystem is higher than that of differential attacking its initial fixed cryptosystem with the same amount of plaintext-ciphertext pairs. The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against differential cryptanalysis.

show abstract

“…, ω t−1 will be replaced every time period P t = T /t. 4. The capability for the attacker intercepting data is almost the same for every time period P t , i.e., the attacker will get N/t plaintext-ciphertext pairs in every time period P t .…”

Section: Model Assumptionmentioning

confidence: 99%

“…The evolutionary DES with more cryptographically robust S-boxes was presented in [1,2] related to differential cryptanalysis and linear cryptanalysis. Utilizing the evolutionary algorithm, Meng et al gave some new results in construction and affinely unequivalent classification of Bent functions in small variables [3][4][5]. Wang presented a novel algorithm for producing Hash-function with high security level, high efficiency and ideal randomness [6].…”

Section: Introductionmentioning

confidence: 99%

Evolutionary cryptography against multidimensional linear cryptanalysis

Zhang

Tang

2011

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

The evolutionary cryptosystem is a new cryptosystem proposed by a Chinese researcher recently. This paper studies its security level resisting against multidimensional linear cryptanalysis in this paper. It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem does for resisting against multidimensional linear cryptanalysis. Multidimensional generalizations of Matsui's Algorithm 1 and Algorithm 2 based on log-likelihood ratio (LLR) statistics are introduced. By the relationship among the data complexity N , the bit advantage a and the success rate P S of these two multidimensional generalized algorithms, it is proven that more data is needed for attacking the evolutionary cryptosystem than that is needed for attacking its initial fixed cryptosystem when the bit advantage and success rate are identical. Moreover, it is shown that both time complexity and memory complexity for attacking the evolutionary cryptosystem are higher than that of attacking its initial fixed cryptosystem with the same data complexity. The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against the multidimensional linear cryptanalysis.

show abstract

Analysis of affinely equivalent Boolean functions

Cited by 13 publications

References 12 publications

A Cryptanalysis Method based on Niche Genetic Algorithm

A Cryptanalysis Method based on Niche Genetic Algorithm

Capability of evolutionary cryptosystems against differential cryptanalysis

Evolutionary cryptography against multidimensional linear cryptanalysis

Contact Info

Product

Resources

About