A novel framework for post-quantum cryptographic schemes based on lattice-theoretic and discrete optimization techniques
*Gaganjot KaurCorresponding authorgaganjot28784@gmail.comDepartment of Computer Science and EngineeringRaj Kumar Goel Institute of TechnologyGhaziabad, Uttar Pradesh, 201017, IndiaView full profile → , Mandeep Kaurmandeep.kaur@bennett.edu.inSchool of Computer Science Engineering & TechnologyBennett UniversityGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , Darapu Umadarapuuma@outlook.comDepartment of Computer Science & EngineeringPragati Engineering CollegeSurampalem, Kakinada District, Andhra Pradesh, 533437, IndiaView full profile → , M. Janaki Rama Raojanakiram.aditya@gmail.comDepartment of Computer ScienceAditya Degree & PG College (Autonomous)Kakinada, Andhra Pradesh, 533003, IndiaView full profile → , D. Balajibalaji@avit.ac.inDepartment of Humanities and Sciences (Mathematics Division)Aarupadai Veedu Institute of TechnologyVinayaka Mission’s Research Foundation (Deemed to be University)Paiyanoor, Chennai, Tamil Nadu, 603104, India0000-0003-2858-2578View full profile → , Meghana Solankimeghanasolanki2025@gmail.comDepartment of Computer EngineeringRamrao Adik Institute of TechnologyD. Y. Patil UniversityNerul, Navi Mumbai, Maharashtra, 400706, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3086
- Pages:
- 4719–4730
Abstract
The fast development of quantum computing is a major threat to the classical cryptographic systems and the emergence of secure and efficient post-quantum cryptographic (PQC) is required. Lattice-based cryptography is one of the potential solutions that have been adopted as one of the promising solutions due to its excellent security grounds and quantum resistant nature. Nevertheless, there are difficulties of large key sizes, high computing power and flexibility to diverse application environments that plague existing lattice-based schemes. This paper introduces a new model which combines lattice-theoretic concepts and discrete optimization methods to improve the performance and scalability of PQC systems. Its methodology includes the use of optimization-based key generation, adaptive parameter choice, and using efficient encryption-decryption mechanisms that are based on the Learning With Errors (LWE) problem. Key metrics, such as key size, computation time and error rate, are used to evaluate the comprehensive performance and compared to the known schemes, such as Kyber, NTRU and Saber. Experimental evidence shows that the given model has the smaller key size of 2.4 KB, shorter calculation time of 13.9 ms and smaller error rate of 0.3 that is superior to existing techniques. The results suggest that the suggested framework offers the best compromise in terms of security, performance, and scalability, thus it is applicable to the next-generation secure communication framework in the post-quantum world.
Keywords
Subject Classifications
References
[1] A. Aikata, A. C. Mert, M. Imran, S. Pagliarini, and S. S. Roy, “KaLi: A crystal for post-quantum security using Kyber and Dilithium,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 70, no. 2, pp. 747–758 (2023).
[2] M. Bisheh-Niasar, R. Azarderakhsh, and M. Mozaffari-Kermani, “High-speed NTT-based polynomial multiplication accelerator for CRYSTALS-Kyber post-quantum cryptography,” IACR Cryptol. ePrint Arch. (2021).
[3] G. Kumawat, T. Kant, V. Bhardwaj, M. Kumar, A. Rashid, and M. T. B. Othman, “Cryptographic protocols for passwordless systems with enhanced security,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 8, pp. 2933–2944 (2025), doi: 10.47974/JDMSC-2438.
[4] C. Gidney and M. Ekerå, “How to factor 2048-bit RSA integers in 8 hours using 20 million noisy qubits,” Quantum, vol. 5, Art. no. 433 (2021).
[5] T. Tosun, E. Oswald, and E. Savaş, “Non-profiled higher-order side-channel attacks against lattice-based post-quantum cryptography,” IACR Cryptol. ePrint Arch. (2025).
[6] R. C. Poonia, T. Singh, C. K. Rajashri, D. Mondal, and S. M. Patil, “Optimizing communication system security through comprehensive testing and intelligent network configurations,” J. Inf. Optim. Sci., vol. 47, no. 5-A, pp. 1709–1717 (2026), doi: 10.47974/JIOS-2261.
[7] N. Babbar, A. K. Sharma, R. K. Saini, and N. K. Verma, “Mathematical foundations of secure AI: Homomorphic encryption for distributed learning systems,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 8, pp. 2967–2975 (2025), doi: 10.47974/JDMSC-2441.
[8] M. J. Kannwischer, J. Rijneveld, P. Schwabe, and K. Stoffelen, “PQM4: Post-quantum crypto library for the ARM Cortex-M4,” (2018).
[9] E. Karabulut and A. Aysu, “Falcon down: Breaking Falcon post-quantum signature scheme through side-channel attacks,” in Proc. 58th ACM/IEEE Design Autom. Conf. (DAC), pp. 691–696 (2021).
[10] D. H. F. Ansari and R. Patil, “Scalable framework for advanced threat analysis,” Int. J. Recent Adv. Eng. Technol., vol. 14, no. 3S, pp. 147–151 (2025), doi: 10.65521/intjournalrecadvengtech.v14i3s.1683.
[11] J. Senor, J. Portilla, and G. Mujica, “Analysis of the NTRU post-quantum cryptographic scheme in constrained IoT edge devices,” IEEE Internet Things J., vol. 9, no. 19, pp. 18778–18790 (2022).
[12] R. Shi, H. Xie, H. Feng, F. Yuan, and B. Liu, “Quantum zero correlation linear cryptanalysis,” Quantum Inf. Process., vol. 21, no. 8, Art. no. 293 (2022).
[13] J. H. Silverman, “An introduction to lattices, lattice reduction, and lattice-based cryptography,” in Lect. Notes PCMI Grad. Summer School (2020).
