Published November 26, 2023 | Version v1
Journal article Open

Lattices in Quantum-ERA Cryptography

Authors/Creators

  • 1. ROR icon Akwa Ibom State University
  • 2. Dennis Osadebay University, Anwai, asaba, Delta State, Nigeria
  • 3. Imo State College of Education

Contributors

Contact person:

  • 1. ROR icon Akwa Ibom State University

Description

The use of Mathematic in cryptography can result a safe encryption scheme. Lattices have emerged as a powerful mathematical tool in the field of cryptography, offering a diverse set of applications ranging from encryption to secure multi-party computation. This research paper provides a comprehensive review of the role of lattices in cryptography, covering both theoretical foundations and practical implementations. The paper begins by introducing the basic concepts of lattices and their relevance in cryptographic protocols. Subsequently, it explores key cryptographic primitives based on lattice problems, such as lattice-based encryption schemes, digital signatures, and fully homomorphic encryption. The paper also proposes a new lattice based cryptographic scheme.

Files

IJRPR19334 (1).pdf

Files (578.1 kB)

Name Size Download all
md5:3b53468e16fb52d0cdf47b53d75824bf
578.1 kB Preview Download

Additional details

Identifiers

URL
https://ijrpr.com/uploads/V4ISSUE11/IJRPR19334.pdf

References

  • Regev, O. (2006, August). Lattice-based cryptography. In Annual International Cryptology Conference (pp. 131-141). Springer, Berlin, Heidelberg.
  • Dadheech, A. (2018, September). Preventing Information Leakage from Encoded Data in Lattice Based Cryptography. In 2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI) (pp. 1952-1955). IEEE.
  • Shor, P. W. (1994, November). Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science (pp. 124-134). Ieee.
  • Ajtai, M. (1996, July). Generating hard instances of lattice problems. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (pp. 99-108). ACM.
  • Nejatollahi, H., Dutt, N., & Cammarota, R. (2017, October). Special session: trends, challenges and needs for lattice-based cryptography implementations. In 2017 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ ISSS) (pp. 1-3). IEEE.
  • Shor, P. W. (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2), 303-332.
  • Nguyen, P. Q., & Stern, J. (2001, March). The two faces of lattices in cryptology. In International Cryptography and Lattices Conference (pp. 146-180). Springer, Berlin, Heidelberg.
  • Michael N. John & Udoaka O. G (2023). Algorithm and Cube-Lattice-Based Cryptography. International journal of Research Publication and reviews, Vol 4, no 10, pp 3312-3315 October 2023.
  • Micciancio, D. (2011). Lattice-based cryptography. Encyclopedia of Cryptography and Security , 713-715.
  • Nyang, D., & Song, J. (1998). Method for hiding information in lattice. Electronics Letters, 34(23), 2226-2228.
  • Schaller, R. R. (1997). Moore's law: past, present and future. I EEE spectrum, 34(6), 52-59.
  • Micciancio, D. (2001). Improving lattice based cryptosystems using the Hermite normal form. In Cryptography and lattices(pp. 126-145). Springer, Berlin, Heidelberg.
  • Michael N. John, Udoaka O. G., "Computational Group Theory and Quantum-Era Cryptography", International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Online ISSN :2394- 4099, Print ISSN : 2395-1990, Volume 10 Issue 6,pp. 01-10, November-December 2023. Available at doi :https://doi.org/10.32628/IJSRSET2310556