Elliptic curve-inspired graph neural networks for lightweight cryptographic verification
Raju M Sairiserairise566@gmail.comDepartment of Electronics & Telecommunication EngineeringYadavrao Tasgaonkar College of Engineering and ManagementBardi, Maharashtra, 410201, IndiaView full profile → , *Nilesh M PawarCorresponding authornmp206@gmail.comDepartment of Information TechnologyYadavrao Tasgaonkar Institute of Engineering and ManagementBardi, Maharashtra, 410201, IndiaView full profile → , Supriya Nilesh Thakursupriyathakur@mmcoe.edu.inDepartment of Electrical EngineeringKarvenagarMarathawada Mitra Mandal’s College of EngineeringPune, Maharashtra, 411052, IndiaView full profile → , Atmaram Shelkeashelke@symlaw.ac.inSymbiosis Law School, Pune (SLS-P)Symbiosis Centre for Advanced Legal Studies and Research (SCALSAR), Symbiosis International (Deemed University)Pune, Maharashtra, 411014, IndiaView full profile → , Bhushan Marutirao Nanchebmnanche@gmail.comDepartment of Information TechnologyAkurdiD. Y. Patil College of EngineeringPune, Maharashtra, 411044, IndiaView full profile → , Vinay Prasad Tamtavinayprasadtamta@gmail.comDepartment of Information TechnologyHemvati Nandan Bahuguna Garhwal UniversitySrinagar, Uttarakhand, 246174, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 05 Nov 2024
- Published Online:
- 30 Aug 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2427
- Pages:
- 1923–1934
Abstract
Keywords
Subject Classifications
References
[1] M. Medwed, J. Heyszl, and C. Paar, “Advanced key-space pruning techniques for meet-in-the-middle attacks on lightweight block ciphers,” IACR Transactions on Symmetric Cryptology, vol. 2021, no. 4, pp. 345–367 (2021).
[2] M. Zhang and W. Hsieh, “Deep reinforcement learning–guided beam search for the traveling salesman problem,” IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 2, pp. 789–802 (Feb. 2023).
[3] D. Cagli and S. Guilley, “TripletNet: Triplet-loss profiling for deep-learning side-channel analysis of AES,” IEEE Transactions on Information Forensics and Security, vol. 18, pp. 1234–1245 (2023).
[4] Kumar, P. Singh, and S. Rani, “DLFA: A deep-learning framework for fault analysis in AES implementations,” Journal of Cryptographic Engineering, vol. 13, no. 1, pp. 55–68 (2024).
[5] X. Li and J. Zhang, “MILP-based automatic differential trail search for lightweight block ciphers,” IACR Journal of Cryptographic Hardware and Embedded Systems, vol. 2023, no. 4, pp. 112–130 (2023).
[6] R. Patel and S. Singh, “A hybrid particle swarm optimization and simulated annealing approach to block cipher key recovery,” International Journal of Information Security, vol. 21, no. 5, pp. 467–484 (2022).
[7] W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!,” IEEE Transactions on Neural Networks and Learning Systems, vol. 32, no. 4, pp. 1620–1633 (Apr. 2021).
[8] E. Borges-Trenard, H. Kim, and R. Singh, “Genetic algorithm partitioning attack on reduced-round DES,” Journal of Cryptographic Engineering, vol. 12, no. 3, pp. 221–234 (2022).
[9] M. Kaur, S. Gupta, and P. Sharma, “MILP differential cryptanalysis of the LELBC lightweight cipher,” IACR ePrint Archive, vol. 2024, no. 448 (2024).
[10] L. Chen, X. Zhao, and Y. Lin, “A hybrid particle swarm optimization and simulated annealing heuristic for block-cipher cryptanalysis,” International Journal of Information Security, vol. 23, no. 1, pp. 45–59 (2024).
[11] Ajo Jose, N. M. Madhavan Namboothiri, and Jineesh Thomas, “Rings of continuous linear transformations on a topological vector space,” Journal of Interdisciplinary Mathematics, vol. 28, no. 4, pp. 1623–1634 (2025), doi: 10.47974/JIM-2164.
[12] Nada A. Laabi and Ansam Al-Sabti, “Stabilizability of non-linear dynamic control systems on time scales in Banach spaces,” Journal of Interdisciplinary Mathematics, vol. 28, no. 3-B, pp. 1073–1079 (2025), doi: 10.47974/JIM-2083.
