Authors : Sourya Dipta Ghosal; Buddhadeb Sau

Volume/Issue : Volume 11 - 2026, Issue 8 - August

Google Scholar : https://tinyurl.com/35eaxmxj

Scribd : https://tinyurl.com/5ay8jjzh

DOI : https://doi.org/10.38124/ijisrt/26aug221

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Abstract : Traditional physical security systems are largely reactive, relying on localized alarms that trigger only after a perimeter breach has occurred. In complex, high-value environment – such as data centers or nuclear facilities – this latency often allows intruders to reach their objectives before an interceptor can arrive. This thesis proposes a proactive security framework that models facility logic as an AND-OR graph, representing potential “attack recipes” as a series of interdependent security states. By employing the AO* optimization algorithm, the system dynamically identifies the most probable paths an intruder might take based on real-time Anomaly detection from distributed sensor networks. To ensure the integrity of the decision-making process against digital tampering, the framework integrates Elliptic Curve Digital Signature Algorithms (ECDSA) to authenticate every state change within the graph. The core of this research investigates whether AO* optimization can significantly reduce the response time of autonomous mobile interceptors (drones or robots) by positioning them at “logic bottlenecks” – points in the AND-OR graph that an intruder must satisfy to complete their objective. Preliminary simulation suggests that this predictive allocation outperforms traditional patrolling methods, providing a robust, self-healing, and mathematically verifiable approach to modern autonomous defense.

Keywords : AO* Algorithm, Interception Latency, High-Security Facilities, Artificial Intelligence, Optimization, Cybersecurity, Elliptic Curve Digital Signature Algorithms, Risk Based Pathfinding, Anomaly Detection.

References :

1. N. Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics, Vol. 3, Springer, Berlin, Heidelberg, 1998.
2. M. Lavanya and V. Natarajan, “LWDSA: Light-weight Digital Signature Algorithm for Wireless Sensor Networks,” S¯adhan¯a, vol. 42, no. 10, pp. 1629–1643, 2017.
3. X. Cui and H. Shi, “A*-based Pathfinding in Modern Computer Games,” International Journal of Computer Science and Network Security, vol. 11, no. 1, pp. 125–130, Jan. 2011.
4. S. Gong, “Recent Progress in ECDSA and DSA Digital Signature Algorithms,” Transactions on Computer Science and Intelligent Systems Research, vol. 6, Proceedings of ISET 2024, Warwick Evans Publishing, 2024.
5. D. Davidov and S. Markovitch, “Multiple-Goal Heuristic Search,” Journal of Artificial Intelligence Research, vol. 26, pp. 417–451, 2006.
6. L. Akoglu, H. Tong, and D. Koutra, “Graph Based Anomaly Detection and Description: A Survey,” Data Mining and Knowledge Discovery, vol. 29, no. 3, pp. 626–688, Springer, 2015.
7. D. Sensarma, “Graph Based Anomaly Detection Techniques: A Review,” in Science and Technology – Recent Updates and Future Prospects, vol. 7, Chapter 4, Book Publisher International, 2024.
8. C. C. Noble and D. J. Cook, “Graph-Based Anomaly Detection,” in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’03), pp. 631–636, ACM, 2003.
9. A. Martelli and U. Montanari, “Additive AND/OR Graphs,” in Proceedings of the 3rd International Joint Conference on Artificial Intelligence (IJCAI), Stanford, California, USA, Aug. 1973, pp. 1–11.
10. X. Hu, M. Yang, C. Liu, W. Cai, et al., “Intelligent Unmanned Defense System for Autonomous Interception of UAVs Based on Improved Acoustic Source Localization Algorithm,” IEEE Access, vol. 13, pp. 1–15, Jan. 2025. doi: 10.1109/ACCESS.2025.3575959.
11. A. Martelli and U. Montanari, “Optimizing Decision Trees Through Heuristically Guided Search,” Communications of the ACM, vol. 21, no. 12, pp. 1025– 1039, Dec. 1978.
12. L. Bassham, D. Johnson, and T. Polk, “Representation of Elliptic Curve Digital Signature Algorithm (ECDSA) Keys and Signatures in Internet X.509 Public Key Infrastructure Certificates,” Internet Draft, Internet Engineering Task Force (IETF), June 1999.
13. T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, July 1985.
14. N. Koblitz, “CM-Curves with Good Cryptographic Properties,” in Advances in Cryptology – CRYPTO ’91, Lecture Notes in Computer Science, vol. 576, Springer-Verlag, 1992, pp. 279–287.
15. H. Zhong, R. Zhao, J. Cui, J. Gao, et al., “An Improved ECDSA Scheme for Wireless Sensor Network,” International Journal of Future Generation Communication and Networking, vol. 9, no. 2, pp. 73–82, Feb. 2016. doi:10.14257/ijfgcn.2016.9.2.08.
16. Y. Gen¸c and E. Afacan, “Design and Implementation of an Efficient Elliptic Curve Digital Signature Algorithm (ECDSA),” in Proceedings of the 2021 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS), Apr. 2021. doi: 10.1109/IEMTRONICS52119.2021.9422589.
17. J. S. Dickens, T. Maweni, T. Setati, and Z. Suddoo, “Design of HERMES: A Mobile Autonomous Surveillance Robot for Security Patrol,” MATEC Web of Conferences, vol. 388, Art. 04005, Dec. 2023. doi: 10.1051/matecconf/202338804005.
18. N. Ferraz Junior, A. A. A. Silva, A. E. Guelfi, and S. T. Kofuji, “Performance Evaluation of Publish–Subscribe Systems in IoT Using Energy-Efficient and Context-Aware Secure Messages,” Journal of Cloud Computing, vol. 11, Art. 6, pp. 1–17, Jan. 2022. doi: 10.1186/s13677-022-00278-6.
19. L. Zhang, W. Li, Z. Zhang, Q. Lu, C. Hou, P. Hu, et al., “LogAttn: Unsupervised Log Anomaly Detection with an Autoencoder-Based Attention Mechanism,” in International Conference on Knowledge Science, Engineering and Management (KSEM 2021), pp. 222–235, 2021.
20. A. Iliev, N. Kyurkchiev, and A. Rahnev, “A Refinement of Knuth’s Extended Euclidean Algorithm for Computing Modular Multiplicative Inverse,” Communications in Applied Analysis, vol. 25, no. 1, pp. 23–37, May 2021. doi:10.12732/caa.v25i1.3.
21. C. P. Schnorr, “Efficient Identification and Signatures for Smart Cards,” in G. Brassard (Ed.), Advances in Cryptology – CRYPTO ’89, Lecture Notes in Computer Science, vol. 435, Springer-Verlag, 1990, pp. 239–252.
22. J. Bresina, R. Dearden, N. Meuleau, S. Ramakrishnan, D. Smith, and R. Washington, “Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI,” in Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI 2002), pp. 77–84, 2002.
23. E. Benazera, R. Brafman, N. Meuleau, and Mausam, “An AO* Algorithm for Planning with Continuous Resources,” in Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005. [cite: 1, 15]
24. A. Konar, Artificial Intelligence and Soft Computing: Behavioral and Cognitive Modeling of the Human Brain, Boca Raton: CRC Press, 1999. [cite: 3, 4]
25. F. Ahmad, R. Khan, and A. A. Nkembi, “Improvement in the Interception Vulnerability Level of Encryption Mechanism in GSM,” Inventions, vol. 10, no. 4, Art. 56, July 2025. doi: 10.3390/inventions10040056.
26. S. Ghosh, “Low-Latency Crypto: An Emerging Paradigm of Lightweight Cryptography,” Presentation Proposal, Intel Labs, Intel Corporation, USA.
27. T. Padmaja and M. Chandar, “A Comprehensive Survey on Lightweight Cryptography Algorithms to Enhance Quality of Service in Medical Internet of Things,” International Journal of Safety and Security Engineering, vol. 15, no. 11, pp. 2403–2417, Nov. 2025. doi: 10.18280/ijsse.151120.
28. S. Narmadha and N. V. Balaji, “Improved Network Anomaly Detection System Using Optimized Autoencoder–LSTM,” Expert Systems with Applications, vol. 273, Art. 126854, Feb. 2025. doi: 10.1016/j.eswa.2025.126854.
29. B. Dowling, M. Fischlin, F. Gu¨nther, and D. Stebila, “A Cryptographic Analysis of the TLS 1.3 Handshake Protocol,” Journal of Cryptology, vol. 34, no. 4, Oct. 2021. doi: 10.1007/s00145-021-09384-1.
30. A. Shah and M. Siddiqui, “Software Architecture for Machine Learning-Based Systems: Issues, Challenges, and Solutions,” Technical Report, Cognitive Lab Camp, June 2023.
31. S. Graupner, H. R. Motahari Nezhad, S. Singhal, and S. Basu, “Making Processes from Best Practice Frameworks Actionable,” in Proceedings of the Workshops of the 12th IEEE International Enterprise Distributed Object Computing Conference (EDOCW 2009), Auckland, New Zealand, Sept. 1–4, 2009. doi:10.1109/EDOCW.2009.5332021.
32. S. Park, J. Y. Lee, and J. Lee, “AI System Architecture Design Methodology Based on IMO (Input–AI Model–Output) Structure for Successful AI Adoption in Organizations,” Data & Knowledge Engineering, vol. 150, Art. 102264, Mar. 2024. doi: 10.1016/j.datak.2023.102264.
33. A. Bosselaers, “MD4/MD5,” in H. C. A. van Tilborg (Ed.), Encyclopedia of Cryptography and Security, Springer, Boston, MA, 2005. doi: 10.1007/0-38723483-7 249.
34. S. Rao, “Advanced SHA-1 Algorithm Ensuring Stronger Data Integrity,” International Journal of Computer Applications, vol. 130, no. 8, pp. 25–27, Nov. 2015. doi: 10.5120/ijca2015907056.
35. S. K. Devineni, S. Kathiriya, and A. Shende, “Machine Learning-Powered Anomaly Detection: Enhancing Data Security and Integrity,” Journal of Artificial Intelligence & Cloud Computing, vol. 2, no. 2, pp. 1–9, May 2023. doi:10.47363/JAICC/2023(2)184.
36. M. Song, “Cryptographic Innovations for Data Integrity in Cloud and IoT Environments,” 2024.
37. B. Mohan Sai and M. Bhatia, “A Survey on IoT Security Using Cryptographic Algorithms,” E3S Web of Conferences, vol. 453, Art. 01048, Nov. 2023. doi:10.1051/e3sconf/202345301048.
38. M. S. Sozol, G. M. Saki, and M. M. Rahman, “Anomaly Detection in Cybersecurity with Graph-Based Approaches,” International Journal of Scientific Research in Engineering and Management (IJSREM), vol. 8, no. 8, pp. 1–5, Aug. 2024. doi: 10.55041/IJSREM37061.
39. W. Wang, Y. Shang, Y. He, Y. Li, and J. Liu, “BotMark: Automated Botnet Detection with Hybrid Analysis of Flow-Based and Graph-Based Traffic Behaviors,” Information Sciences, vol. 511, pp. 284–296, 2020. doi: 10.1016/j.ins.2019.09.024.
40. N. Dilini, N. Sun, Y. Miao, and N. Moustafa, “A Comprehensive Review on Graph-Based Anomaly Detection: Approaches for Intrusion Detection,” Applied Sciences, vol. 16, no. 4, Art. 1906, 2026. doi: 10.3390/app16041906.
41. S. Lamba and M. Sharma, “An Efficient Elliptic Curve Digital Signature Algorithm (ECDSA),” in Proceedings of the 2013 International Conference on Machine Intelligence and Research Advancement (ICMIRA), Katra, India, 2013, pp. 179–183. doi: 10.1109/ICMIRA.2013.41.
42. C. Alioanei and N. Popescu, “AI-Based Solutions for Security and Resource Optimization in IoT Environments: A Systematic Review,” Information, vol. 16, no. 10, Art. 841, 2025. doi: 10.3390/info16100841.
43. A.-M. T. Ehis, “Optimization of Security Information and Event Management (SIEM) Infrastructures, and Events Correlation/Regression Analysis for Optimal Cyber Security Posture,” Archives of Advanced Engineering Science, July 2023. doi: 10.47852/bonviewAAES32021068.
44. K. Ikpe and E. Ashigwuike, “Enterprise Network Design and Security Optimization,” Open Access Library Journal, vol. 12, no. 3, pp. 1–17, Jan. 2025. doi: 10.4236/oalib.1112489.
45. A. A. A. Lateef, H. A. El Shenbary, A. A. Gouda, and M. A. Razek, “Optimization Algorithms for Path Routing and Security in Software-Defined Networking (SDN),” International Journal of Computing and Digital Systems, vol. 15, no. 1, pp. 1–15, Jan. 2026. Received Sept. 2, 2025; revised Nov. 22, 2025; accepted Dec. 2, 2025.
46. S. Sivakumar, A. Lawrence, and A. L. Selvakumar, “Time Complexity Analysis and Comparison of SHA Algorithms,” Journal of Advanced Research in Dynamical and Control Systems, vol. 11, no. 2, pp. 1922–1927, Feb. 2019. doi:10.7717/peerj-cs.981.
47. K. Ali, F. Akhtar, S. A. Memon, A. Shakeel, A. Ali, and A. Raheem, “Performance of Cryptographic Algorithms Based on Time Complexity,” in Proceedings of an IEEE Conference, IEEE, 2023.
48. N. Hasan and P. B. Gari, “Time-Complexity Characterization of NIST Lightweight Cryptography Finalists,” arXiv preprint arXiv:2602.05641 [cs.CR], 2026. doi: 10.48550/arXiv.2602.05641.