|
|
|
| A New Lattice Reduction Algorithm Based on Genetic Strategy |
| Liu Xiang-hui①② Han Wen-bao①② Quan Jian-xiao③ |
①(PLA Information Engineering University, Zhengzhou 450002, China)
②(State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450002, China)
③(Jiangnan Institute of Technology, Wuxi 214083, China) |
|
|
|
|
Abstract Lattice reduction algorithms play an important role in the field of cryptanalysis. In this paper, based on the strategies of genetic algorithm, a new lattice reduction algorithm is proposed through the transformation of the initial lattice basis. The new algorithm always can obtain a shorter vector and a higher quality basis compared with the original algorithms. By the new algorithm, some lattice bases of the Shortest Vector Problem (SVP) challenge are experienced and the outputs of the new algorithm can always reach or break the records on the internet which illustrates that the new algorithm behaves well.
|
|
Received: 30 November 2012
|
|
|
|
Corresponding Authors:
Liu Xiang-hui
E-mail: lxhkz2002@163.com
|
|
|
|
|
|
|
2013, Vol. 35 
