Open AccessAnalysing recursive preprocessing of BKZ lattice reduction algorithm
Author(s) -
Mokammel Haque Md.,
Pieprzyk Josef
Publication year - 2017
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2016.0049
Subject(s) - lattice reduction , algorithm , lattice problem , preprocessor , enumeration , mathematics , reduction (mathematics) , lattice (music) , computational complexity theory , computer science , cryptography , combinatorics , artificial intelligence , statistics , beamforming , physics , geometry , mimo , acoustics
Lattice problems are considered as the key elements in many areas of computer science as well as in cryptography; the most important of which is the shortest vector problem and its approximate variants. Algorithms for this problem are known as lattice reduction algorithms. Currently, the most practical lattice reduction algorithm for such problems is the block Korkine–Zolotarev (BKZ) algorithm and its variants. The authors optimise both the pruning and the preprocessing parameters of the recursive (aborted, extreme pruned) preprocessing of the BKZ lattice reduction algorithm and improve the results from Asiacrypt'11 by Chen and Nguyen. The authors derive approximate closed‐form complexity formulas (based on the sandpile model assumption model by Hanrot et al .) for the enumeration time which allow a simple estimation of complexity without running the simulation algorithm (by Chen and Nguyen) and asymptotically suggests a modified extreme pruning bounding profiles with different parameters. Hence, the authors’ contributions are in optimising and improving the analysis of the complexity upper bound estimates presented by Chen and Nguyen, based on the same recursive‐BKZ preprocessing model.