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.展开更多
The Grain v1 stream cipher is one of the seven finalists in the final e STREAM portfolio. Though many attacks have been published,no recovery attack better than exhaustive key search on full Grain v1 in the single key...The Grain v1 stream cipher is one of the seven finalists in the final e STREAM portfolio. Though many attacks have been published,no recovery attack better than exhaustive key search on full Grain v1 in the single key setting has been found yet. In this paper,new state recovery attacks on Grain v1 utilizing the weak normality order of the employed keystream output function in the cipher are proposed. These attacks have remarkable advantages in the offline time,online time and memory complexities,which are all better than exhaustive key search. The success probability of each new attack is 0.632. The proposed attack primarily depends on the order of weak normality of the employed keystream output function. This shows that the weak normality order should be carefully considered when designing the keystream output functions of Grain-like stream ciphers.展开更多
To avoid the exhaustive search, we propose a fast user selection algorithm for Signal-to-Interference-plus-Noise-Ratio (SINR)-based multiuser Multiple-Input Multiple-Output (MIMO) systems with Alamouti Space-Time Bloc...To avoid the exhaustive search, we propose a fast user selection algorithm for Signal-to-Interference-plus-Noise-Ratio (SINR)-based multiuser Multiple-Input Multiple-Output (MIMO) systems with Alamouti Space-Time Block Code (STBC) transmit scheme. A locally optimal selection criterion is proposed at first. Then, the incremental selection approach is applied, which selects one among the residual available users to maximize the minimum user SINR step by step. Simulation results show that the fast algorithm gains over 90% of the diversity benefit achieved by the exhaustive search selection, and that the fast algorithm has much lower computational burden than the exhaustive search one, for the scenario where the number of all the available users is much greater than that of the selected users.展开更多
A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low ...A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.展开更多
基金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.
基金supported in part by the National Natural Science Foundation of China (Grant No.61202491,61272041,61272488,61402523,61602514)the Science and Technology on Communication Security Laboratory Foundation of China under Grant No.9140C110303140C11051
文摘The Grain v1 stream cipher is one of the seven finalists in the final e STREAM portfolio. Though many attacks have been published,no recovery attack better than exhaustive key search on full Grain v1 in the single key setting has been found yet. In this paper,new state recovery attacks on Grain v1 utilizing the weak normality order of the employed keystream output function in the cipher are proposed. These attacks have remarkable advantages in the offline time,online time and memory complexities,which are all better than exhaustive key search. The success probability of each new attack is 0.632. The proposed attack primarily depends on the order of weak normality of the employed keystream output function. This shows that the weak normality order should be carefully considered when designing the keystream output functions of Grain-like stream ciphers.
文摘To avoid the exhaustive search, we propose a fast user selection algorithm for Signal-to-Interference-plus-Noise-Ratio (SINR)-based multiuser Multiple-Input Multiple-Output (MIMO) systems with Alamouti Space-Time Block Code (STBC) transmit scheme. A locally optimal selection criterion is proposed at first. Then, the incremental selection approach is applied, which selects one among the residual available users to maximize the minimum user SINR step by step. Simulation results show that the fast algorithm gains over 90% of the diversity benefit achieved by the exhaustive search selection, and that the fast algorithm has much lower computational burden than the exhaustive search one, for the scenario where the number of all the available users is much greater than that of the selected users.
基金This work is supported by National Natural Science Foundation of China （50776005）.
文摘A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.
