Lattice Based Cryptography : Its Applications, Areas of Interest & Future Scope

With a recent increase in the advancement of the technology, computer system and it’s sensitive data are getting exhibited to unauthorised users, with steadily corroding the fundamentals of computer security. This, in fact, demanded fundamental innovations that require several cryptographic paradigms and security protocol. Previously it was thought that asymmetric cryptographic key like RSA, Diffie-Hellman, are very hard to decrypt by classical computation, but with the implementation of quantum computation, it is proved that this kind of cryptographic algorithm is very easy to decrypt and hackers can steal important Data [3], [6]. After the release of Ajtai’s research paper " Generating Hard Instances of Lattice Problem" [2], a million reasons arose in the minds of the researchers to develop on methods based on lattice-based cryptography to improve their security needs. Firstly, it provided much stronger security, and the average-case of several problems in lattice-based cryptography seems equivalent to the worst-case problem of these problems [2]. Moreover, lattices have the potential to persuade the cryptanalytic attacks created by any quantum computers i.e Quantum Computational Secure [3]. In this paper, we will discuss lattice-based cryptosystem, it’s security dimensions, a general brief on how it works, future scope, applications and areas of Interest.

[1]  Daniele Micciancio,et al.  Improving Lattice Based Cryptosystems Using the Hermite Normal Form , 2001, CaLC.

[2]  R. Schaller,et al.  Moore's law: past, present and future , 1997 .

[3]  Daehun Nyang,et al.  Method for hiding information in lattice , 1998 .

[4]  Oded Regev,et al.  Lattice-Based Cryptography , 2006, CRYPTO.

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  Aarti Dadheech Preventing Information Leakage from Encoded Data in Lattice Based Cryptography , 2018, 2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[7]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Phong Q. Nguyen The Two Faces of Lattices in Cryptology , 2001, Selected Areas in Cryptography.

[9]  Peter W. Shor Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1999 .

[10]  Daniele Micciancio Lattice-Based Cryptography , 2011, Encyclopedia of Cryptography and Security.

[11]  Michael Rose,et al.  Lattice-based cryptography: a practical implementation , 2011 .

[12]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[13]  Nikil Dutt,et al.  Special session: trends, challenges and needs for lattice-based cryptography implementations , 2017, 2017 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).