loading
Papers

Research.Publish.Connect.

Paper

Authors: Dipayan Das 1 and Vishal Saraswat 2

Affiliations: 1 Department of Mathematics, National Institute of Technology (NIT), Durgapur and India ; 2 Department of Computer Science and Engineering, Indian Institute of Technology (IIT), Jammu and India

ISBN: 978-989-758-319-3

Keyword(s): Lattice Based Crypto, CVP, SVP, Lattice Reduction.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security ; Security Protocols

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 wel l-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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.172.195.49

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 2 SECRYPT: SECRYPT, ISBN 978-989-758-319-3, pages 496-501. DOI: 10.5220/0006862106620667

@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 2 SECRYPT: SECRYPT,},
year={2018},
pages={496-501},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006862106620667},
isbn={978-989-758-319-3},
}

TY - CONF

JO - Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 2 SECRYPT: 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/0006862106620667

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.