Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm

Md Mokammel Haque, Josef Pieprzyk, Asaduzzaman

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

Abstract

We investigate the terminating concept of BKZ reduction first introduced by Hanrot et al. [Crypto'11] and make extensive experiments to predict the number of tours necessary to obtain the best possible trade off between reduction time and quality. Then, we improve Buchmann and Lindner's result [Indocrypt'09] to find sub-lattice collision in SWIFFT. We illustrate that further improvement in time is possible through special setting of SWIFFT parameters and also through the combination of different reduction parameters adaptively. Our contribution also include a probabilistic simulation approach top-up deterministic simulation described by Chen and Nguyen [Asiacrypt'11] that can able to predict the Gram-Schmidt norms more accurately for large block sizes.

Original languageEnglish
Title of host publicationIFOST 2014
Subtitle of host publicationProceedings of the 9th International Forum on Strategic Technology
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-4
Number of pages4
ISBN (Electronic)9781479960620, 9781479960606
DOIs
Publication statusPublished - 17 Dec 2014
Externally publishedYes
Event9th International Forum on Strategic Technology, IFOST 2014 - Cox's Bazar, Bangladesh
Duration: 21 Oct 201423 Oct 2014

Other

Other9th International Forum on Strategic Technology, IFOST 2014
Country/TerritoryBangladesh
CityCox's Bazar
Period21/10/1423/10/14

Keywords

  • BKZ
  • Cryptosystem
  • Hermite factor
  • Lattice reduction
  • SWIFFT

Fingerprint

Dive into the research topics of 'Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm'. Together they form a unique fingerprint.

Cite this