Research progress of Lattice bases reduction algorithms
As a linear structure, cryptosystems based on lattice has the incomparable advantage of lower energy consumption, so in the future they will also have a wide range of use for intelligent terminal. Compared with traditional public key cryptosystem: RSA, ECC, the based lattice cryptosystems can be proved secure, it have shown the important role in post-quantum cryptography era. The core of the algorithms problems are base reduction, for 20 years, being inspired LLL lattice reduction algorithm, there are some stronger, and faster algorithm, no matter in accurate, or approximate, they has an important role to cryptanalysis and cryptosystems design. This article attempts to give a survey of stateof-the-art lattice reduction algorithm.
lattice reduced base Short Vector Problem (SVP) LLL algorithm algorithm complexity
ZHOU ShiXiang YIN Chao XU Hui
College of Science Shandong University of Technology Zibo, Shandong, China School of Information & Statistics Guangxi University of Finance & Economics Nanning, China
国际会议
杭州
英文
550-553
2012-03-23（万方平台首次上网日期，不代表论文的发表时间）