Evaluating the performance of the practical lattice reduction algorithms

Md Mokammel Haque, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

Abstract

We investigate the current state-of-art performance of lattice reduction algorithms. We perform experiments to examine the limit of the practical lattice reduction algorithms such as Recursive-BKZ. We report a better attack on SWIFFT lattices based on a recent improvement of BKZ reduction. We also participate in several lattice challenges that evaluate the performance of the lattice-reduction algorithms. Our experimental results thus compare and sometimes concretize the previous similar work in this area.

Original languageEnglish
Title of host publication8th International Conference on Electrical and Computer Engineering
Subtitle of host publicationAdvancing Technology for a Better Tomorrow, ICECE 2014
Place of PublicationPicataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages341-344
Number of pages4
ISBN (Electronic)9781479941667, 9781479941674
ISBN (Print)9781479941650
DOIs
Publication statusPublished - 28 Jan 2015
Externally publishedYes
Event8th International Conference on Electrical and Computer Engineering, ICECE 2014 - Dhaka, Bangladesh
Duration: 20 Dec 201422 Dec 2014

Other

Other8th International Conference on Electrical and Computer Engineering, ICECE 2014
CountryBangladesh
CityDhaka
Period20/12/1422/12/14

Keywords

  • BKZ
  • Cryptosystem
  • Lattice Challenge
  • Lattice Reduction
  • SWIFFT

Fingerprint Dive into the research topics of 'Evaluating the performance of the practical lattice reduction algorithms'. Together they form a unique fingerprint.

Cite this