Evolutionary cryptography against multidimensional linear cryptanalysis

Zhang, Huanguo; Li, Chunlei; Tang, Ming

doi:10.1007/s11432-011-4494-2

Cited by 4 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cryptography is one of the most significant techniques in the field of information security [25,26,26,28,29,30]. The use of evolutionary computation to analyze the cryptology is the product of evolutionary computation and cryptography combined with each other, 30 years, and many scholars at home and abroad this series of research and study, and made a lot of achievements.…”

Section: Cryptology Evolution Analysis Of the Development Trend Of Thmentioning

confidence: 99%

“…The evolutionary cryptosystem is a new cryptosystem proposed by a Chinese research recently [29]. This article by using the combination of evolutionary computing and cryptanalysis technigues, the cryptanalysis object by a specific mathematical model to describe it in the search process, it can be automatically accessed and the accumulated knowledge of the search space.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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%

Section: Introductionmentioning

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

“…In the field of Cryptography, researchers in China have made a lot of progresses in recent years [2][3][4][5], which certainly provides a strong support for the development of trusted computing. In December 2007, State Cryptography Administration Bureau of China published the functionality and interface specification of cryptographic support platform for trusted computing [6], which marks a new stage of the development of trusted computing in China.…”

Section: Trusted Computing Infrastructurementioning

confidence: 99%

Recent advances on trusted computing in China

Dong

Chen

2012

Chin. Sci. Bull.

View full text Add to dashboard Cite

This article highlights some recent research advances on trusted computing in China, focusing mainly on the methodologies and technologies related to trusted computing module, trusted computing platform, trusted network connection, trusted storage, and trustworthy software. Trusted computing leads an emerging trend in information technology towards improving the trustworthiness and security of computer systems. It has attracted great worldwide attention from both academia and industry in recent years.In particular, computer scientists in China have devoted considerable effort to this challenge and have made substantial achievements, which enables them to be at the forefront of this area. This article gives a review of some recent research progress in the methodology and technology of trusted computing in China. We summarize the major advancements in this field from two aspects: trusted computing infrastructure and trustworthy software.

show abstract

“…The capabilities of evolutionary cryptosystem against linear and differential cryptanalysis were given in [16,17], respectively. To search for good polynomials for the number field sieve with evolutionary computing, we need to solve the difficulty that the space of candidate polynomials is too big.…”

Section: Introductionmentioning

confidence: 99%

On the coefficients of the polynomial in the number field sieve

Yang

Meng

Wang

et al. 2015

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

Polynomial selection is very important in the number field sieve. If the number of relations a pair of polynomials can generate is closely correlated with the coefficients of the polynomials, we can select polynomials by checking the coefficients first, which can speed up the selection of good polynomials. In this paper, we aim to study the correlation between polynomial coefficients and the number of relations the polynomials can generate. By analyzing the zero roots, it is found that a polynomial with the ending coefficient containing more small primes usually can generate more relations than the one whose ending coefficient contains less. As a polynomial with more real roots usually can generate more relations, using the complete discrimination system, the requirements on the coefficients of a polynomial to obtain more real roots are analyzed. For instance, a necessary condition for a polynomial of degree d to have d distinct real roots is that the coefficient of degree d − 2 should be negative or small enough. The result in the case d = 3 can be used directly in selecting polynomials generated by the nonlinear method, where d = 3 is already enough for practical purpose.

show abstract

Evolutionary cryptography against multidimensional linear cryptanalysis

Cited by 4 publications

References 14 publications

A Cryptanalysis Method based on Niche Genetic Algorithm

A Cryptanalysis Method based on Niche Genetic Algorithm

Recent advances on trusted computing in China

On the coefficients of the polynomial in the number field sieve

Contact Info

Product

Resources

About