This paper presents a method for differen- tial collision attack of reduced FOX block cipher based on 4-round distinguishing property. It can be used to attack 5, 6 and 7-round FOX64 and 5-round FOX128. Our attack has...This paper presents a method for differen- tial collision attack of reduced FOX block cipher based on 4-round distinguishing property. It can be used to attack 5, 6 and 7-round FOX64 and 5-round FOX128. Our attack has a precomputation phase, but it can be obtained before attack and computed once for all. This attack on the reduced to 4-round FOX64 requires only 7 chosen plaintexts, and performs 242.8 4-round FOX64 encryptions. It could be extended to 5 （6, 7）-round FOX64 by a key exhaustive search behind the fourth round.展开更多
A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results ...A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.展开更多
A modified harmony search algorithm with co-evolutional control parameters(DEHS), applied through differential evolution optimization, is proposed. In DEHS, two control parameters, i.e., harmony memory considering rat...A modified harmony search algorithm with co-evolutional control parameters(DEHS), applied through differential evolution optimization, is proposed. In DEHS, two control parameters, i.e., harmony memory considering rate and pitch adjusting rate, are encoded as a symbiotic individual of an original individual(i.e., harmony vector). Harmony search operators are applied to evolving the original population. DE is applied to co-evolving the symbiotic population based on feedback information from the original population. Thus, with the evolution of the original population in DEHS, the symbiotic population is dynamically and self-adaptively adjusted, and real-time optimum control parameters are obtained. The proposed DEHS algorithm has been applied to various benchmark functions and two typical dynamic optimization problems. The experimental results show that the performance of the proposed algorithm is better than that of other HS variants. Satisfactory results are obtained in the application.展开更多
Differential evolution （DE） is a global optimizer for continuous design variables. To enhance DE, it is necessary to handle discrete design variables. In this paper, a discrete differential evolution （DDE） algorit...Differential evolution （DE） is a global optimizer for continuous design variables. To enhance DE, it is necessary to handle discrete design variables. In this paper, a discrete differential evolution （DDE） algorithm is proposed to handle discrete design variables The proposed DDE is based on the DE/l/rand/bin method. In the proposed DDE, the mutation ratio is regarded as the exchange probability, and thus, no modifications of DE/l/rand/bin are required. In addition, in order to maintain diversity through the search process, we initialize all search points. By introducing the initialization of all search points, global or quasi-optimum solution can be found. We validate the proposed DDE by applying it to several benchmark problems.展开更多
基金This work has been performed in the Project "The Research on the New Analysis in Block Ciphers" supported by the Fundamental Research Funds for the Central Universities of China，the National Natural Science Foundation of China，the 111 Project of China，the Scientific Research Foundation of Education Department of Shaanxi Provincial Government of China
文摘This paper presents a method for differen- tial collision attack of reduced FOX block cipher based on 4-round distinguishing property. It can be used to attack 5, 6 and 7-round FOX64 and 5-round FOX128. Our attack has a precomputation phase, but it can be obtained before attack and computed once for all. This attack on the reduced to 4-round FOX64 requires only 7 chosen plaintexts, and performs 242.8 4-round FOX64 encryptions. It could be extended to 5 （6, 7）-round FOX64 by a key exhaustive search behind the fourth round.
基金Project(2011FJ3016)supported by the Research Foundation of Science & Technology Office of Hunan Province,China
文摘A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.
基金Project(2013CB733605)supported by the National Basic Research Program of ChinaProject(21176073)supported by the National Natural Science Foundation of China
文摘A modified harmony search algorithm with co-evolutional control parameters(DEHS), applied through differential evolution optimization, is proposed. In DEHS, two control parameters, i.e., harmony memory considering rate and pitch adjusting rate, are encoded as a symbiotic individual of an original individual(i.e., harmony vector). Harmony search operators are applied to evolving the original population. DE is applied to co-evolving the symbiotic population based on feedback information from the original population. Thus, with the evolution of the original population in DEHS, the symbiotic population is dynamically and self-adaptively adjusted, and real-time optimum control parameters are obtained. The proposed DEHS algorithm has been applied to various benchmark functions and two typical dynamic optimization problems. The experimental results show that the performance of the proposed algorithm is better than that of other HS variants. Satisfactory results are obtained in the application.
文摘Differential evolution （DE） is a global optimizer for continuous design variables. To enhance DE, it is necessary to handle discrete design variables. In this paper, a discrete differential evolution （DDE） algorithm is proposed to handle discrete design variables The proposed DDE is based on the DE/l/rand/bin method. In the proposed DDE, the mutation ratio is regarded as the exchange probability, and thus, no modifications of DE/l/rand/bin are required. In addition, in order to maintain diversity through the search process, we initialize all search points. By introducing the initialization of all search points, global or quasi-optimum solution can be found. We validate the proposed DDE by applying it to several benchmark problems.
