What is it about?
There are some crytosystems that are built on the presumed hardness of the Lattice problem. Solving this lattice problem is considered as breaking those cyrptos. BKZ is one of the algorithms that can solve the problem (or approximately/closely do so). Preprocessing is a technique that is used alongside BKZ and its other subroutines such as enumeration. This paper tells about the improvement of the optimization technique used in the preprocessing (sometimes also mentioned as Recursive-BKZ) of the BKZ.
Featured Image
Photo by Markus Spiske on Unsplash
Why is it important?
So that we can break (seemingly improve) the lattice based cryptosystems.
Perspectives
I think this is more theoretical that practical. Much work still remain. i.e. to solve a lattice basis of higher dimension with this proposed algorithm.
Dr. Md. Mokammel Haque
Chittagong University of Engineering and Technology
Read the Original
This page is a summary of: Preprocessing Optimization: Revisiting Recursive-BKZ Lattice Reduction Algorithm , IET Information Security, June 2018, the Institution of Engineering and Technology (the IET),
DOI: 10.1049/iet-ifs.2017.0400.
You can read the full text:
Contributors
The following have contributed to this page
