A mathematical hybrid lattice–elliptic curve encryption model for lightweight IoT security
*K. ShirishaCorresponding authorshirisha49@yahoo.comDepartment of Computer Science and EngineeringSreenidhi Institute of Science and TechnologyHyderabad, Telangana, 501302, IndiaView full profile → , T. Venkata Satya Vivektvsvivek@ifheindia.orgDepartment of Artificial Intelligence & Data ScienceICFAI Foundation for Higher EducationHyderabad, Telangana, 501203, IndiaView full profile → , Ruth Ramya Kalangiramya_cse@kluniversity.inDepartment of Computer Science and EngineeringKoneru Lakshmaiah Education FoundationGuntur, Andhra Pradesh, 522302, IndiaView full profile → , R. Sarath Babusarathbabu.r@bvrithyderabad.edu.inDepartment of Computer Science & EngineeringBVRIT Hyderabad College of Engineering for WomenHyderabad, Telangana, 500118, IndiaView full profile → , M. Manimarandrmanimaranm@gmail.comDepartment of Computer Science and Engineering (Cyber Security)Easwari Engineering CollegeRamapuram, Chennai, 600089, Tamil Nadu, IndiaView full profile → , D. Vetrithangamvetrigold@gmail.comDepartment of Computer Science & EngineeringUniversity Institute of EngineeringChandigarh UniversityMohali, Punjab, 140413, IndiaView full profile → , V. Vinithavinitha.v-cs@dsu.edu.inDepartment of Computer Science and Engineering (Cyber Security)Dayananda Sagar UniversityHarohalli, Bengaluru, Karnataka, 562112, IndiaView full profile → , Diana Georgedianageorge1994@gmail.comDepartment of Computer Science and EngineeringDayananda Sagar UniversityHarohalli, Bengaluru, Karnataka, 562112, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2025
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2809
- Pages:
- 3683–3692
Abstract
Conventional public-key cryptosystems such as RSA and standard elliptic curve cryptography (ECC), although widely deployed, remain vulnerable to quantum adversaries and incur prohibitive computational overhead when applied to microcontroller-class IoT endpoints. This paper presents a novel hybrid cryptographic framework that integrates Ntru-lattice-based encryption (NTRU) with elliptic curve Diffie-Hellman (ECDH) key exchange and SHA-3 integrity verification to construct a layered, post-quantum-resilient security architecture. The proposed scheme exploits the algebraic structure of polynomial rings over truncated polynomial quotients to achieve both hardness guarantees rooted in the shortest vector problem (SVP) and the computational efficiency required by embedded platforms. We formalize the security reduction under the ring learning with errors (RLWE) assumption and provide a rigorous mathematical analysis of key generation, encryption, and decryption sub-protocols. Experimental evaluation on ARM Cortex-M4 and RISC-V FPGA platforms demonstrates that the proposed scheme achieves 256-bit equivalent security with encryption latency of 9.7 ms, outperforming RSA-2048 by 78% and ECC-256 by 47% in identical deployment configurations. Memory footprint is reduced to 3.2 KB compared to 11.4 KB for conventional RSA implementations.
Keywords
Subject Classifications
References
[1] D. J. Bernstein and T. Lange, “Post-quantum cryptography: Current state and quantum mitigation,” IEEE Security Privacy, vol. 20, no. 1, pp. 10–20 (Jan. 2022).
[2] J. W. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler, and D. Stehlé, “CRYSTALS-Kyber: A CCA-secure module-lattice-based KEM,” in Proc. IEEE Eur. Symp. Security Privacy (EuroS&P), pp. 353–367 (2021).
[3] A. Hülsing, J. Rijneveld, J. M. Schanck, and P. Schwabe, “High-speed key encapsulation from NTRU,” in Proc. Cryptographic Hardware Embedded Syst. (CHES), pp. 232–252 (2022).
[4] P. Ravi, S. Bhasin, S. S. Roy, and A. Chattopadhyay, “Drop by drop you break the rock—exploiting generic vulnerabilities in lattice-based PKE/KEMs using EM-based physical attacks,” IEEE Trans. Comput., vol. 71, no. 8, pp. 1900–1912 (2022).
[5] A. Soni and R. Mishra, “Hybrid TLS with post-quantum key exchange for IoT edge gateways: Performance and security analysis,” J. Netw. Comput. Appl., vol. 203, pp. 103–121 (Jun. 2023).
[6] E. Alkim, L. Ducas, T. Pöppelmann, and P. Schwabe, “Post-quantum key exchange—A new hope,” in Proc. USENIX Security Symp., pp. 327–343 (2022).
[7] A. Banerjee, T. Das, and S. Ghosh, “Lightweight authenticated encryption for constrained IoT devices using Keccak sponge,” IEEE Internet Things J., vol. 10, no. 6, pp. 4820–4833 (Mar. 2023).
[8] R. Patel and V. Gupta, “Benchmarking post-quantum cryptographic algorithms on RISC-V embedded processors,” Microprocess. Microsyst., vol. 95, Art. no. 104676 (Sep. 2022).
[9] L. Wang, X. Chen, and Y. Liu, “Graph-based hierarchical key management for large-scale industrial IoT using elliptic curve pairings,” IEEE Trans. Ind. Inform., vol. 19, no. 4, pp. 5213–5224 (Apr. 2023).
[10] N. Kumar and P. Rao, “FPGA acceleration of post-quantum NTRU polynomial operations using number theoretic transforms,” J. Parallel Distrib. Comput., vol. 178, pp. 104–117 (Aug. 2023).
[11] S. Salunkhe, A. O. Mulani, D. Shahane, M. Rana, S. M. Shukla, and M. M. Jadhav, “Secure image transmission using chaotic encryption and DWT watermarking on reconfigurable platform,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 349–361 (2026).
[12] K. R. Chaudhari, A. O. Mulani, M. P. Gajare, V. Jadhav, P. Yawle, and A. V. Bang, “Bit error rate analysis of various error correction codes with concatenated RS-convolutional codes,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 199–214 (2026).
