A Novel Lattice Reduction Algorithm

Dipayan Das, Vishal Saraswat

2018

Abstract

The quantum threats have made the traditional number theoretic cryptography weak. Lattice based cryptographic constructions are now considered as an alternative of the number theoretic cryptography which resists the quantum threats. The cryptographic hardness of the lattice based constructions mainly lies on the difficulty of solving two problems, namely, shortest vector problem (SVP) and closest vector problem (CVP). Solving these problems become “somewhat” easier if the lattice basis is almost orthogonal. Given any basis, finding an almost orthogonal basis is termed as lattice basis reduction (or simply lattice reduction). The SVP has been shown to be reducible to the CVP but the other way is still an open problem. In this paper, we work towards proving the equivalence of the CVP and SVP and provide a history of the progress made in this direction. We do a brief review of the existing lattice reduction algorithms and present a new lattice basis reduction algorithm similar to the well-studied Korkine-Zolotareff (KZ) reduction which is used frequently for decoding lattices. The proposed algorithm is very simple — it calls the shortest vector oracle for n − 1 times and outputs an almost orthogonal lattice basis with running time O(n3), n being the rank of the lattice.

Paper Citation

in Harvard Style

Das D. and Saraswat V. (2018). A Novel Lattice Reduction Algorithm.In Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT, ISBN 978-989-758-319-3, pages 496-501. DOI: 10.5220/0006862104960501

in Bibtex Style

@conference{secrypt18,
author={Dipayan Das and Vishal Saraswat},
title={A Novel Lattice Reduction Algorithm},
booktitle={Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,},
year={2018},
pages={496-501},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006862104960501},
isbn={978-989-758-319-3},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,
TI - A Novel Lattice Reduction Algorithm
SN - 978-989-758-319-3
AU - Das D.
AU - Saraswat V.
PY - 2018
SP - 496
EP - 501
DO - 10.5220/0006862104960501