Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles

Author:

Amirkhanova Dana Sairangazhykyzy1ORCID,Iavich Maksim2ORCID,Mamyrbayev Orken3ORCID

Affiliation:

1. Department of Cybersecurity, Information Processing and Storage, Satbayev University, Almaty 050013, Kazakhstan

2. School of Technology, Caucasus University, Tbilisi 0102, Georgia

3. Department of Information Systems, Institute of Information and Computing Technologies, Almaty 050013, Kazakhstan

Abstract

Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC with algorithms like Shor’s algorithm, which can accelerate computations exponentially. This risks exposing these systems to attacks, necessitating quantum-resistant cryptography. Cloud computing poses data security concerns, requiring robust cryptographic mechanisms and access controls. Lattice-based cryptography, leveraging problems like the Short Integer Solution (SIS), emerges as a solution. This paper presents a novel quantum-resistant public key encryption scheme based on ElGamal and SIS, ensuring security against quantum and classical threats in modern cryptographic environments.

Funder

the Shota Rustaveli National Science Foundation of Georgia

Publisher

MDPI AG

Reference27 articles.

1. Ajtai, M. (1996;, January 22–24). Generating hard instances of lattice problems. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA. Preliminary version in STOC.

2. Regev, O. (2006, January 20–24). Lattice-based cryptography. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.

3. New lattice-based cryptographic constructions;Regev;J. ACM (JACM),2004

4. Micciancio, D., and Goldwasser, S. (2002). Closest vector problem. Complexity of Lattice Problems: A Cryptographic Perspective, Springer.

5. Hanrot, G., Pujol, X., and Stehlé, D. (June, January 30). Algorithms for the shortest and closest lattice vector problems. Proceedings of the International Conference on Coding and Cryptology, Qingdao, China.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3