TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Special Issue

Advances in Discrete Mathematics and Secure Network Technologies (Part-A)

Volume 29, Issue 2-A·February 2026·40 articles

Articles

Open Access Research Article·pp. i–ix·Vol. 29, Issue 2-AFeb 2026

Special Issue on Advances in Discrete Mathematics and Secure Network Technologies (Part-A)

Ramesh Chandra Poonia, Kamal Upreti, Sonali Gaur, Sheela Hundekari, Jyoti Parashar, Smriti Khanna, Soumi Ghosh, Anup Lal Yadav et al.

Published Online: 05 Feb 2026DOI: 10.47974/JDMSC-29-2-A-Foreword

In this paper: This special issue titled “Advances in Discrete Mathematics and Secure Network Technologies”, brings together a diverse and timely collection of research papers that highlight the strong convergence o...

AbstractFull Text PDF (144 KB)Views: 195Downloads: 108Citations: 0
Open Access Research Article·pp. 397–410·Vol. 29, Issue 2-AFeb 2026

Implementation of IRIS authentication on industrial IoT devices for secured boot process

Pragya Vaishnav, Md. Ashraful Babu, Swati Jain, Shilpa Sharma, Vaibhav Bhavnagar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2470

In this paper: Instant Retrieval Information System (IRIS) is a hardware subsystem designed to provide IoT devices with secure boot functionality. The author presents an iris can be used to IoT devices, together wit...

AbstractReferencesFull Text PDF (307 KB)Views: 238Downloads: 84Citations: 0
Open Access Research Article·pp. 411–419·Vol. 29, Issue 2-AFeb 2026

Strategic approaches to enhancing data security in intelligent power networks through technology and policy

Cholaraja Mudimannan, Sonam Singh Bhati, Atmaram Shelke, Priyadarshan Dhabe, Kommineni Ravi Kumar, Cherukuri Krishna Veni

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2472

In this paper: Fast-changing smart grids have transformed the energy business by enabling real-time tracking, automation, and electricity sharing.  However, digitisation has caused data security challenges including...

AbstractReferencesFull Text PDF (510 KB)Views: 190Downloads: 98Citations: 0
Open Access Research Article·pp. 421–428·Vol. 29, Issue 2-AFeb 2026

Investigating time-sensitive security threats and their impact on networked communication systems in real-time environments

Aparajita Mohanty, K. N. Raja Praveen, Parikshit Mahalle, Kommuri Srinivasa Rao, A. Sandeep Kumar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2473

In this paper: Networked communication systems are necessary for making sure that important data is shared quickly in real-time settings. But these systems are facing more and more problems from time-sensitive secur...

AbstractReferencesFull Text PDF (420 KB)Views: 134Downloads: 79Citations: 0
Open Access Research Article·pp. 429–436·Vol. 29, Issue 2-AFeb 2026

Applying permutations to optimize topological sorting algorithms in discrete mathematical structures

Girish Abhyankar, Chetan Kumar Sharma, Veeresh Malagi, Archana Chaudhari, N. Eswara Rao, M. Purnachandra Rao

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2474

In this paper: In discrete mathematics, topological sorting is very important, especially when working with directed acyclic graphs (DAGs). Optimizing topological sorting methods is important for making computers wo...

AbstractReferencesFull Text PDF (376 KB)Views: 145Downloads: 80Citations: 0
Open Access Research Article·pp. 437–444·Vol. 29, Issue 2-AFeb 2026

Analysis of edge colorings and c¢(G) in discrete structures using graph theoretic approaches

Tanveer Ahmad Wani, Pragati Patil Bedekar, Shital Raut, Tina Porwal, M. Purnachandra Rao, B. N. Mallikharjuna Rao

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2475

In this paper: Edge colorings are a fundamental component of graph theory used to identify the optimal approach to improve discrete structures, particularly for issues like ordering and resource allocation. It indic...

AbstractReferencesFull Text PDF (453 KB)Views: 143Downloads: 97Citations: 0
Open Access Research Article·pp. 445–452·Vol. 29, Issue 2-AFeb 2026

Enhancing RSA algorithm security through advanced combinatorial n! permutations in cryptographic protocols

Amol Sapatnekar, Deepika Sharma, Rita Thakare, Anita Dombale, Vikas Nandgaonkar, S. Radhakrishnan

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2476

In this paper: Quantum computing and improved cryptanalysis have rendered the RSA algorithm less safe, but it remains a vital aspect of public-key encryption. Newly, this work enhances the RSA algorithm’s secure pro...

AbstractReferencesFull Text PDF (438 KB)Views: 180Downloads: 71Citations: 0
Open Access Research Article·pp. 453–460·Vol. 29, Issue 2-AFeb 2026

Optimization of discrete data structures via combinatorial stirling numbers of the second kind

Shashikala Gurpur, Sudhakar Reddy, Gagan Tiwari, Vaishali Rajput, Ch. Phanindra, A. Suneetha

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2477

In this paper: Optimizing discrete data structures speeds up program development, security, and data storage. This study analyses how Combinatorial Stirling Numbers of the Second Kind improve discrete data structure...

AbstractReferencesFull Text PDF (383 KB)Views: 173Downloads: 87Citations: 0
Open Access Research Article·pp. 461–468·Vol. 29, Issue 2-AFeb 2026

Application of Ramsey numbers R(m,n) in analyzing connectivity and coloring problems in discrete graphs

Vaishali Rahate, Sagarkumar S. Badhiye, Parikshit Mahalle, Veerendra Yadav, G. V. K. Kishore, G. Mahesh Reddy

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2478

In this paper: Discrete graph theory explains connectivity and colouring issues. Ramsey numbers (R(m,n)) are significant for this. Ramsey numbers illustrate the minimum number of vertices a whole graph requires to h...

AbstractReferencesFull Text PDF (508 KB)Views: 114Downloads: 111Citations: 0
Open Access Research Article·pp. 469–477·Vol. 29, Issue 2-AFeb 2026

Investigating the structural properties of the Tower of Hanoi problem, using combinatorial approaches

P. S. Patil, Tanveer Ahmad Wani, Virendra Thakur, Satchidanand Satpute, J. Charishma, G. Srujana

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2479

In this paper: Mathematicians and computer scientists have long been interested in the Tower of Hanoi issue due of its many fascinating possibilities. This combinatorial research examines the Tower of Hanoi problem’...

AbstractReferencesFull Text PDF (422 KB)Views: 92Downloads: 122Citations: 0
Open Access Research Article·pp. 479–487·Vol. 29, Issue 2-AFeb 2026

Implementation of heuristic combinatorial algorithms based on binomial coefficients for network design

Varsha Anup Jujare, Kumari Shipra, Pallavi R. Rege, Richa Dwivedi, K. Tejaswi, K. B. V. Rama Nara Simham

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2483

In this paper: It is very important for complicated communication networks to be well designed so that they can use their resources well, handle errors, and grow as needed.  This study shows a new way to solve netwo...

AbstractReferencesFull Text PDF (351 KB)Views: 95Downloads: 80Citations: 0
Open Access Research Article·pp. 489–495·Vol. 29, Issue 2-AFeb 2026

Enhancing combinatorial partitioning techniques using the Riemann hypothesis for n-dimensional discrete structures

Puneet Kumar Yadav, Pradnya Borkar, Yashwant Dongre, Mohammad Alamgir Hossain, N. Hari Krishna, Navdeep Singh

Published Online: 23 Jan 2026DOI: 10.47974/JDMSC-2487

In this paper: Combinatorial splitting methods help visualise complicated arrangements in n-dimensional discrete structures. Using the Riemann hypothesis related with broad variety principle to combinatorial splitti...

AbstractReferencesFull Text PDF (329 KB)Views: 113Downloads: 79Citations: 0
Open Access Research Article·pp. 497–504·Vol. 29, Issue 2-AFeb 2026

Investigating Cartesian product of graphs for enhancing discrete structures in combinatorial mathematics

Vivek Saraswat, Abhinav Shrivastava, Budigi Prabhakar, Ezhilarasan Ganesan, N. Malathi, Rajeev Sobti

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2489

In this paper: In graph theory, the Cartesian product of graphs is a powerful process that joins the structure of two graphs in a way that opens up new ideas and uses in combinatorial mathematics. The focus of this...

AbstractReferencesFull Text PDF (366 KB)Views: 186Downloads: 78Citations: 0
Open Access Research Article·pp. 505–513·Vol. 29, Issue 2-AFeb 2026

Analysis of discrete algorithms using the Diophantine equations for efficient problem solving

Amit Garg, Kirti Bikram, Kumari Shipra, Ambuj Kumar Agarwal, P. Aravind, Ginni Nijhawan

Published Online: 07 Feb 2026DOI: 10.47974/JDMSC-2490

In this paper: This paper looks at how Diophantine equations can be used to analyze and improve discrete algorithms so that they can solve problems more quickly. Finding integer answers to polynomial equations using...

AbstractReferencesFull Text PDF (326 KB)Views: 175Downloads: 83Citations: 0
Open Access Research Article·pp. 515–522·Vol. 29, Issue 2-AFeb 2026

Application of the Möbius function in algebraic structures for combinatorial number theory

Chetan Kumar Sharma, Bhupesh Chintamani, Vikas Kolekar, Simranjeet Nanda, P. N. Sundari, Aman Mittal

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2491

In this paper: The Möbius function is an important arithmetic function in number theory. It’s also very important to the examiner of algebraic patterns and combinatorial mathematics. Further to conventional range pr...

AbstractReferencesFull Text PDF (307 KB)Views: 248Downloads: 232Citations: 0
Open Access Research Article·pp. 523–532·Vol. 29, Issue 2-AFeb 2026

Exploring n-Queens problem solutions through advanced combinatorial and discrete mathematical techniques

Natasha Martin, Vimal Bibhu, Vikas Kolekar, E. R. Aruna, P. Veeresh Kumar, Vaibhav Mittal

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2492

In this paper: The n-Queens problem involves positioning n chess queens on an n×n board without any of them threatening one other. Typical combinatorial issue in computer math. This topic has been studied in graph t...

AbstractReferencesFull Text PDF (520 KB)Views: 117Downloads: 103Citations: 0
Open Access Research Article·pp. 533–541·Vol. 29, Issue 2-AFeb 2026

Developing secure communication protocols using elliptic curve cryptography for IoT devices

Gaikwad Vidya Shrimant, Robert Halam, Gagan Tiwari, Chilukuri Sulakshana, R. Ramesh, Atul Singla

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2493

In this paper: As IoT devices grow, contact safety is critical. IoT devices lack computer power and connection, making it difficult to collect precise, exclusive data. Elliptic Curve encryption (ECC), which is short...

AbstractReferencesFull Text PDF (378 KB)Views: 132Downloads: 68Citations: 0
Open Access Research Article·pp. 543–551·Vol. 29, Issue 2-AFeb 2026

Implementing robust frequency hopping techniques for secure radio communication using elliptic curves

Arjit Tomar, Devulapalli Praveen Kumar, Amol Dattatray Sonawane, Syed Mohd Uzair Iqbal, Pusuluri Madhubabu, Soosan Chhabra

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2495

In this paper: Modern wireless networks require additional and safer communication techniques, pushing better encryption and frequency hopping. Elliptic curve cryptography (ECC) makes radio communication safer, and...

AbstractReferencesFull Text PDF (449 KB)Views: 139Downloads: 83Citations: 0
Open Access Research Article·pp. 553–561·Vol. 29, Issue 2-AFeb 2026

Designing efficient OFDM systems with embedded elliptic curve cryptography for data protection

Kishor Pandurang Jadhav, Vivek Kumar Sinha, D. Krishna, Amruta Thorat, R. Madhuri, Lavish Kansal

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2496

In this paper: Modern wireless communication networks employ Orthogonal Frequency Division Multiplexing (OFDM), which resists multipath fading and maximises spectrum usage. Wireless networks’ private data must be pr...

AbstractReferencesFull Text PDF (344 KB)Views: 88Downloads: 56Citations: 0
Open Access Research Article·pp. 563–570·Vol. 29, Issue 2-AFeb 2026

Analyzing the performance of wireless sensor networks using polynomial cryptography methods

Saurabh Bhattacharya, Leena Indise, Nisha Pandey, Bhushan Marutirao Nanche, S. Ramakrishna, Gaurav Sethi

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2497

In this paper: Wireless Sensor Networks (WSNs) are used in environmental monitoring, industry automation, and military surveillance. However, their limited power, memory, and computer capabilities make personal comm...

AbstractReferencesFull Text PDF (454 KB)Views: 158Downloads: 89Citations: 0
Open Access Research Article·pp. 571–579·Vol. 29, Issue 2-AFeb 2026

Enhancing secure access in RF communications through advanced elliptic curve encryption

Samir N. Ajani, Jayita Moulick, Jyoti Mohur, R. Hannah Jessie Rani, Amol Dattatray Sonawane, Priti Shende

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2498

In this paper: Wireless communication technologies are developing so swiftly, particularly radio frequency (RF) interactions, that many people are concerned about the safety of transmitting data. Protecting the safe...

AbstractReferencesFull Text PDF (451 KB)Views: 139Downloads: 85Citations: 0
Open Access Research Article·pp. 581–588·Vol. 29, Issue 2-AFeb 2026

Enhancing cloud computing security with advanced password encryption techniques and multi-factor authentication

Minal Shahakar, Puneet Kumar Yadav, Shafi Ahmad Khanday, Pravin Jangid, Y. Prasanthi, Manisha Jagdish More

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2499

In this paper: As cloud computing grows, safety becomes increasingly crucial. User registration is a cloud security weakness because weak or stolen passwords let hackers entry. This research examines how to make clo...

AbstractReferencesFull Text PDF (293 KB)Views: 175Downloads: 77Citations: 0
Open Access Research Article·pp. 589–597·Vol. 29, Issue 2-AFeb 2026

Utilizing post-quantum cryptography to secure Internet of Things (IoT) devices against quantum attacks

Isha Saluja, Latika Rahul Desai, Anjali Bhardwaj, Vivek Deshpande, Navdeep Singh, Pawan Gawade

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2501

In this paper: IoT devices use outdated secure methods that are vulnerable to quantum computer attacks, making quantum computing a huge security issue. As quantum computers get smarter, RSA and ECC may not be able t...

AbstractReferencesFull Text PDF (422 KB)Views: 275Downloads: 108Citations: 2
Open Access Research Article·pp. 599–607·Vol. 29, Issue 2-AFeb 2026

Developing adaptive password strength algorithms using deep learning for enhanced cybersecurity

Latika Rahul Desai, Poorna Shankar, Jambi Ratna Raja Kumar, Deepika Sharma, L. Mary Gladence, Mohammad Alamgir Hossain

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2502

In this paper: Often exploited by brute-force and credential-stuffing attacks, modern protection methods are still generally weak and simple to guess passwords. Because they are constant and ignore the context, trad...

AbstractReferencesFull Text PDF (473 KB)Views: 213Downloads: 108Citations: 0
Open Access Research Article·pp. 609–616·Vol. 29, Issue 2-AFeb 2026

Effective strategies for writing maintainable code in cryptographic software development

Gaganjot Kaur, Mandeep Kaur, Jaswinder Singh, Malem Mangal Laishram, Sorabh Lakhanpal, Malayaj Kumar

Published Online: 04 Feb 2026DOI: 10.47974/JDMSC-2503

In this paper: Maintainability is crucial for long-term cryptographic software security and quick threat adaptation. This paper discusses ways to strengthen cryptographic software code maintainability with an emphas...

AbstractReferencesFull Text PDF (330 KB)Views: 200Downloads: 102Citations: 0
Open Access Research Article·pp. 617–627·Vol. 29, Issue 2-AFeb 2026

Implementing secure elliptic curve cryptography for blockchain-based financial transactions

Dilip Motwani, Vidya Chitre, Varsha Bhosale, Madhu M Nashipudmath, Sharmila Shinde, Amit Nerurkar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2504

In this paper: Strong, quick, and extensible security solutions are required as blockchain technology is utilised more and more in financial systems to guarantee that transactions are honest, genuine, and can’t be c...

AbstractReferencesFull Text PDF (345 KB)Views: 247Downloads: 87Citations: 0
Open Access Research Article·pp. 629–636·Vol. 29, Issue 2-AFeb 2026

Advancing homomorphic encryption techniques for ensuring privacy in cloud-based analytics

Swati V. Khidse, Davinder Kaur Sohi, Vimal Bibhu, Vikas Nandgaonkar, Atul Singla, Suman Kumar Swarnkar

Published Online: 04 Feb 2026DOI: 10.47974/JDMSC-2505

In this paper: Vulnerabilities in modern cloud analytics have become more pronounced with the rapid adoption of cloud-based analytics in high impact and sensitive domains like healthcare, finance and IoT; the demand...

AbstractReferencesFull Text PDF (328 KB)Views: 158Downloads: 98Citations: 0
Open Access Research Article·pp. 637–645·Vol. 29, Issue 2-AFeb 2026

Strengthening cryptographic protocols with AI-driven security measures in digital communications

Navin Suvarna, Rajesh Phursule, D. G. Bhalke, Arjit Tomar, Mohammad Alamgir Hossain, R. Vasanthan

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2506

In this paper: In an age of sophisticated cyber threats, secure digital communications are a necessity. Conventional cryptographic protocols like AES and RSA offer data confidentiality and integrity, but they are st...

AbstractReferencesFull Text PDF (303 KB)Views: 229Downloads: 97Citations: 0
Open Access Research Article·pp. 647–654·Vol. 29, Issue 2-AFeb 2026

Leveraging facial recognition and AI for enhanced biometric security systems in urban surveillance

Varinder Singh Rana, Suraj Bhan, Jivantika Gulati, Sushil Bhise, Gayatri Dattatraya Londhe, Nitin Dhawas

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2507

In this paper: Facial recognition software is becoming a staple of biometric security in public spaces whose urban surveillance systems grow ever more reliant on the technology. However, in unconstrained city enviro...

AbstractReferencesFull Text PDF (363 KB)Views: 196Downloads: 82Citations: 0
Open Access Research Article·pp. 655–662·Vol. 29, Issue 2-AFeb 2026

Exploring facial biometrics in multi-factor authentication systems for secure banking applications

Mandeep Kaur, Mayank Kumar Goyal, Durga Prasad Yadav, Shankar M. Patil, Malayaj Kumar, Mohammed Eltahir Abdelhag

Published Online: 07 Feb 2026DOI: 10.47974/JDMSC-2508

In this paper: Due to convenience, as well as its security, facial recognition is fast becoming an important component of multi-factor authentication (MFA) for biometric authentication, especially banking. So, while...

AbstractReferencesFull Text PDF (339 KB)Views: 242Downloads: 91Citations: 0
Open Access Research Article·pp. 663–670·Vol. 29, Issue 2-AFeb 2026

Enhancing digital communication security with wavelet transforms for efficient data encryption

Navin Suvarna, Gitanjali Shrivastava, D. G. Bhalke, Paul Praveen, Amol Dattatray Sonawane, Mohammed Eltahir Abdelhag

Published Online: 27 Jan 2026DOI: 10.47974/JDMSC-2509

In this paper: In the modern telehealth, secure transmission of the signals of biomedical signals, notably electrocardiogram (ECG) data, is crucial. In this paper, we propose a new hybrid encryption scheme in wavele...

AbstractReferencesFull Text PDF (436 KB)Views: 140Downloads: 75Citations: 0
Open Access Research Article·pp. 671–680·Vol. 29, Issue 2-AFeb 2026

Mining large-scale data using AI-integrated lattice and poset structures

Priti C. Golar, Archana R. Panhalkar, Leena Kshitij Gautam, Anorgul Ashirova, Supriya Gupta Bani, K.D.V. Prasad

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2510

In this paper: Combining methods from artificial intelligence (AI) with lattice theory and partially ordered sets (posets) is shown in this study as a new way to better mine huge amounts of data. It is easier to fin...

AbstractReferencesFull Text PDF (440 KB)Views: 216Downloads: 100Citations: 0
Open Access Research Article·pp. 681–689·Vol. 29, Issue 2-AFeb 2026

Pattern recognition in computer vision using discrete structures and deep learning

Rashmi Ashtagi, Anant Kaulage, Anusha Pai, Ranjeet Vasant Bidwe, Vaishali Rajput, Basavaraj Madagouda

Published Online: 04 Feb 2026DOI: 10.47974/JDMSC-2511

In this paper: This work looks into ways to use deep learning and discrete mathematical structures together to make computer vision pattern recognition better. The suggested mixed models combine vector metric spaces...

AbstractReferencesFull Text PDF (414 KB)Views: 208Downloads: 94Citations: 0
Open Access Research Article·pp. 691–700·Vol. 29, Issue 2-AFeb 2026

AI techniques in extremal combinatory for robust error detection

Minal Bodke, Saurabh Saoji, Vanisha P. Vaidya, Sardor Sabirov, Shweta Goyal, E. Mohan

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2513

In this paper: This work focuses at how to construct strong mistake detection systems by combining sophisticated AI techniques with extremal combinatory concepts. The study uses mathematical frameworks based on vect...

AbstractReferencesFull Text PDF (466 KB)Views: 136Downloads: 91Citations: 0
Open Access Research Article·pp. 711–720·Vol. 29, Issue 2-AFeb 2026

Symmetric cryptographic systems enhanced with AI-aided group theory models

Rashmi Welekar, Ketaki Naik, Dinesh Kute, Zokir Mamadiyarov, Shweta Goyal, Vaibhav Arjunrao Parjane

Published Online: 03 Feb 2026DOI: 10.47974/JDMSC-2517

In this paper: By adding AI-driven group theory models to symmetric encryption systems, this study shows a new way to make them better.  We create AI programs that look at complicated group structures to make it eas...

AbstractReferencesFull Text PDF (517 KB)Views: 161Downloads: 83Citations: 0
Open Access Research Article·pp. 721–730·Vol. 29, Issue 2-AFeb 2026

ML techniques in polynomial algebra for advanced signal processing

Chithirai Pon Selvan, Swaroop Ramaswamy, Aakash Shivaji Yadav, Ulugbek Bobamuratov, Anjali V. Pise, Alaknanda S. Patil

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2518

In this paper: This study looks at how machine learning (ML) and polynomial math can be used together to improve advanced signal processing. The study creates new mathematical models that use the polynomial structur...

AbstractReferencesFull Text PDF (661 KB)Views: 170Downloads: 91Citations: 0
Open Access Research Article·pp. 731–739·Vol. 29, Issue 2-AFeb 2026

Quantum-resistant cryptographic algorithms grounded in discrete mathematical foundations

Vikramsinha V. Mane, Mahesh P. Jagtap, Santosh Shivlal Dhamone, Avinash B. Raut, Kirti Wanjale, Samariddin Makhmudov

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2519

In this paper: Classical encryption algorithms are in serious danger from quantum computing, so new algorithms that can’t be broken by quantum computers need to be made. This essay looks at discrete mathematical con...

AbstractReferencesFull Text PDF (326 KB)Views: 206Downloads: 83Citations: 0
Open Access Research Article·pp. 741–748·Vol. 29, Issue 2-AFeb 2026

Homomorphism encryption techniques leveraging AI and advanced algebraic structures

Sachin Arun Thanekar, Deepali Mahesh Gohil, Ganesh Dagadu Puri, Syed Sumera Ali, Kishor Pandurang Jadhav

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2520

In this paper: This paper introduces homomorphic encryption using AI and complex mathematical concepts. Use vector measure spaces and orthogonal sequences to identify the optimal encryption settings using AI models....

AbstractReferencesFull Text PDF (376 KB)Views: 174Downloads: 78Citations: 0
Open Access Research Article·pp. 749–757·Vol. 29, Issue 2-AFeb 2026

Cryptographic key generation using graph theory and AI-based combinatorics

Pradeep Kundlik Deshmukh, Ketaki Naik, Manoj D. Tambakhe, Zokir Mamadiyarov, Navneet Joshi, V. K. Chaitanya Varma

Published Online: 04 Feb 2026DOI: 10.47974/JDMSC-2521

In this paper: AI-based combinatorial optimization and graph theory are used together in this study to show a new way to make encryption keys.  Graph structures like vector measure spaces and orthogonal sequences ar...

AbstractReferencesFull Text PDF (362 KB)Views: 236Downloads: 95Citations: 0