By Topic

Research Progress of Lattice Bases Reduction Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
ShiXiang Zhou ; Coll. of Sci., Shandong Univ. of Technol., Zibo, China ; Chao Yin ; Hui Xu

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.

Published in:

Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on  (Volume:1 )

Date of Conference:

23-25 March 2012