DocumentCode :
3571433
Title :
Research Progress of Lattice Bases Reduction Algorithms
Author :
Zhou ShiXian ; Yin Chao ; Xu Hui
Author_Institution :
Coll. of Sci., Shandong Univ. of Technol., Zibo, China
Volume :
1
fYear :
2012
Firstpage :
550
Lastpage :
553
Abstract :
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 algorithm´s 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 cryptosystem´s design. This article attempts to give a survey of state-of-the-art lattice reduction algorithm.
Keywords :
computational complexity; energy consumption; lattice theory; public key cryptography; quantum cryptography; ECC; LLL lattice reduction algorithm; RSA; cryptanalysis design; cryptosystem design; energy consumption; intelligent terminal; lattice bases reduction algorithms; lattice cryptosystems; linear structure; post-quantum cryptography era; public key cryptosystem; Algorithm design and analysis; Approximation algorithms; Approximation methods; Cryptography; Lattices; Polynomials; Vectors; LLL algorithm; Short Vector Problem (SVP); algorithm complexity; lattice; reduced base;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on
Print_ISBN :
978-1-4673-0689-8
Type :
conf
DOI :
10.1109/ICCSEE.2012.366
Filename :
6187906
Link To Document :
بازگشت