Evaluating the performance of the practical lattice reduction algorithms

Md Mokammel Haque; Josef Pieprzyk

doi:10.1109/ICECE.2014.7026884

Evaluating the performance of the practical lattice reduction algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

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 language	English
Title of host publication	8th International Conference on Electrical and Computer Engineering
Subtitle of host publication	Advancing Technology for a Better Tomorrow, ICECE 2014
Place of Publication	Picataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	341-344
Number of pages	4
ISBN (Electronic)	9781479941667, 9781479941674
ISBN (Print)	9781479941650
DOIs	https://doi.org/10.1109/ICECE.2014.7026884
Publication status	Published - 28 Jan 2015
Externally published	Yes
Event	8th International Conference on Electrical and Computer Engineering, ICECE 2014 - Dhaka, Bangladesh Duration: 20 Dec 2014 → 22 Dec 2014

Other

Other	8th International Conference on Electrical and Computer Engineering, ICECE 2014
Country/Territory	Bangladesh
City	Dhaka
Period	20/12/14 → 22/12/14

Keywords

BKZ
Cryptosystem
Lattice Challenge
Lattice Reduction
SWIFFT

Access to Document

10.1109/ICECE.2014.7026884

Cite this

@inproceedings{d81d51bd99614648bf2c5a9e98f0ea83,

title = "Evaluating the performance of the practical lattice reduction algorithms",

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.",

keywords = "BKZ, Cryptosystem, Lattice Challenge, Lattice Reduction, SWIFFT",

author = "Haque, \{Md Mokammel\} and Josef Pieprzyk",

year = "2015",

month = jan,

day = "28",

doi = "10.1109/ICECE.2014.7026884",

language = "English",

isbn = "9781479941650",

pages = "341--344",

booktitle = "8th International Conference on Electrical and Computer Engineering",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "8th International Conference on Electrical and Computer Engineering, ICECE 2014 ; Conference date: 20-12-2014 Through 22-12-2014",

}

Haque, MM & Pieprzyk, J 2015, Evaluating the performance of the practical lattice reduction algorithms. in 8th International Conference on Electrical and Computer Engineering: Advancing Technology for a Better Tomorrow, ICECE 2014., 7026884, Institute of Electrical and Electronics Engineers (IEEE), Picataway, NJ, pp. 341-344, 8th International Conference on Electrical and Computer Engineering, ICECE 2014, Dhaka, Bangladesh, 20/12/14. https://doi.org/10.1109/ICECE.2014.7026884

Evaluating the performance of the practical lattice reduction algorithms. / Haque, Md Mokammel; Pieprzyk, Josef.
8th International Conference on Electrical and Computer Engineering: Advancing Technology for a Better Tomorrow, ICECE 2014. Picataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2015. p. 341-344 7026884.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Evaluating the performance of the practical lattice reduction algorithms

AU - Haque, Md Mokammel

AU - Pieprzyk, Josef

PY - 2015/1/28

Y1 - 2015/1/28

N2 - 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.

AB - 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.

KW - BKZ

KW - Cryptosystem

KW - Lattice Challenge

KW - Lattice Reduction

KW - SWIFFT

UR - https://www.scopus.com/pages/publications/84923261024

U2 - 10.1109/ICECE.2014.7026884

DO - 10.1109/ICECE.2014.7026884

M3 - Conference proceeding contribution

SN - 9781479941650

SP - 341

EP - 344

BT - 8th International Conference on Electrical and Computer Engineering

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Picataway, NJ

T2 - 8th International Conference on Electrical and Computer Engineering, ICECE 2014

Y2 - 20 December 2014 through 22 December 2014

ER -

Evaluating the performance of the practical lattice reduction algorithms

Abstract

Other

Keywords

Access to Document

Other files and links

Fingerprint

Cite this