TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·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
Volume 29·Issue 10-C·October 2026·31 ArticlesSpecial Issue

Volume 29, Issue 10-C

Articles

Open Access Research Article·pp. i–viii·Vol. 29, Issue 10-COct 2026

Foreword of - Special Issue on - Advances in Discrete Mathematics and Secure Network Technologies (Part-C)

Ramesh Chandra Poonia, Ankur Goyal, Amol Dhumane, Raja Kumar Rajaboina, K. Rajendra Prasad, Arul Kumar Natarajan

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-29-10-C-Foreword

In this paper: This special issue entitled “Advances in Discrete Mathematics and Secure Network Technologies” brings together a comprehensive collection of research papers on current trends in discrete mathematics,...

AbstractFull Text PDF (126 KB)Views: 12Downloads: 6Citations: 0
Open Access Research Article·pp. 4429–4441·Vol. 29, Issue 10-COct 2026

Graph-based access control models for cloud security

Archana Ugale, Mittapalli Premchandh, Chetansinh R. Vaghela, Sidhant Sanjay Kulkarni, Ajay Kushwaha, Makineedi Raja Babu

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3063

In this paper: The paper presents a graph-based access control model for cloud security which uses a formal graph structure to represent entities and their relationship. The proposed model describes cloud entities,...

AbstractReferencesFull Text PDF (1.0 MB)Views: 8Downloads: 5Citations: 0
Open Access Research Article·pp. 4443–4455·Vol. 29, Issue 10-COct 2026

Blockchain security analysis through graph connectivity

Kamlesh Vasantrao Patil, Akshay S. Gaikwad, Deepika Sharma, Manisha Sagar Pawar, P. Jeyanthi, Dheeraj Kalra, Karnati Ramesh

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3064

In this paper: The increasing use of the Blockchain systems in industries such as finance, supply chains and even smart cities has increased the need for robust and scalable security mechanisms. Although existing bl...

AbstractReferencesFull Text PDF (738 KB)Views: 15Downloads: 7Citations: 0
Open Access Research Article·pp. 4457–4471·Vol. 29, Issue 10-COct 2026

Bio-inspired combinatorial models for encryption algorithms

Yogita Deepak Sinkar, Putta Chandana, Soumitra Das, Vikas Singh, Chetansinh R. Vaghela, Rahul A. Padgilwar, Ashok Bhansali

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3065

In this paper: The growing use of digital communication systems, cloud infrastructure, and Internet of things (IoT) environments has aggravated the necessity to have strong and dynamic encryption schemes to protect...

AbstractReferencesFull Text PDF (801 KB)Views: 8Downloads: 4Citations: 0
Open Access Research Article·pp. 4473–4482·Vol. 29, Issue 10-COct 2026

Ramsey theory applications in network security

Madhumay Sen, P. Ramya Krishna, M. Thamizhsudar, S. V. Panchami, Dharmesh Dhabliya, Nilam S. Patil

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3066

In this paper: Ramsey Theory is a strong tool of combinatorics of studying the patterns that will inevitably occur in complex networks and is of great importance in network security. The current paper introduces an...

AbstractReferencesFull Text PDF (626 KB)Views: 8Downloads: 4Citations: 0
Open Access Research Article·pp. 4483–4496·Vol. 29, Issue 10-COct 2026

Enumeration of graph factorizations and cryptographic uses

Yogita Deepak Sinkar, Deepika Dalavi, Aradhana Sahu, Sheetal Kusal, Ram Balbhim Ghogare, Akshay Hemant Gongane, R. Shanthi

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3067

In this paper: The problem of listing factorizations of graph is a computationally expensive problem, and has not been successfully applied in the design of cryptographic systems up to date. This paper will solve th...

AbstractReferencesFull Text PDF (739 KB)Views: 10Downloads: 7Citations: 0
Open Access Research Article·pp. 4497–4508·Vol. 29, Issue 10-COct 2026

Privacy-preserving authentication using zero-knowledge proofs

Minal Bodke, Vinod S. Sapkal, Pooja Mishra, Priyanka D. More, Dinesh Yadav, Dipak Sethi

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3068

In this paper: Privacy preserving authentication has become one of the most important needs in the contemporary digital systems where the verification of identity should be done without disclosing any sensitive info...

AbstractReferencesFull Text PDF (520 KB)Views: 10Downloads: 5Citations: 0
Open Access Research Article·pp. 4509–4520·Vol. 29, Issue 10-COct 2026

Complexity bounds for NP-hard problems in cryptography

Monika Patil, D. Sathis Kumar, Gagan Tiwari, Vinod S. Sapkal, Jyotsna Suryavanshi, Sanjiv Kumar Shukla

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3069

In this paper: The complexity bounds of NP-hard problems are one of the main topics in modern cryptography, where the security of a scheme is frequently based on the intractability of the computations. This paper ex...

AbstractReferencesFull Text PDF (1,021 KB)Views: 9Downloads: 4Citations: 0
Open Access Research Article·pp. 4521–4534·Vol. 29, Issue 10-COct 2026

Finite automata models for secure protocol verification

Rohit Agarwal, Rajesh Kumar Tripathi, Arjit Tomar, Prashant Vijay Thokal, Shwetambari Pandurang Katake, Chhavi Patle

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3070

In this paper: Modern digital infrastructures (such as cloud computing, IoT systems and distributed applications) heavily rely on secure communication protocols in which confidentiality, integrity, and authenticatio...

AbstractReferencesFull Text PDF (568 KB)Views: 7Downloads: 5Citations: 0
Open Access Research Article·pp. 4535–4546·Vol. 29, Issue 10-COct 2026

Structural decomposition of finite semigroups

Darapu Uma, Khushboo, Huma Khan, Kotteti Santosh Rupa Manjusha, Uday Chandrakant Patkar, D. Raghavendra Gowda, Suvarna Milind Patil

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3071

In this paper: The systematic structure of finite semigroups allows analysis of finite semigroups in terms of inner algebraic structure and behavior. The paper will talk about the decomposition method used on the ba...

AbstractReferencesFull Text PDF (486 KB)Views: 13Downloads: 7Citations: 0
Open Access Research Article·pp. 4547–4556·Vol. 29, Issue 10-COct 2026

Algebraic construction and security evaluation of substitution boxes using finite field and permutation group techniques

M. Manideepika, Dinesh Baban Kute, Amruta Tejaskumar Mokashi, Padmavati Shrivastava, Dipak Sethi, Pooja Pathak

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3072

In this paper: S-boxes (substitution boxes) are essential nonlinear elements that guarantee confusion in symmetric cryptosystems, but it is still difficult to come up with structures that have a good algebraic and c...

AbstractReferencesFull Text PDF (680 KB)Views: 13Downloads: 9Citations: 0
Open Access Research Article·pp. 4557–4570·Vol. 29, Issue 10-COct 2026

Machine learning assisted cryptanalysis of block ciphers

Anusha Sreeram, Priya Chaudhary, Rajeev Sharma, Prakhar Goyal, Kaustubh Milind Utpat, Vudathu Sobha, Yagna B. Adhyaru

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3073

In this paper: The growing use of secure digital communication systems in various fields like cloud computing, Internet of Things (IoT), and critical infrastructure has heightened concerns on the need to have strong...

AbstractReferencesFull Text PDF (669 KB)Views: 8Downloads: 9Citations: 0
Open Access Research Article·pp. 4571–4582·Vol. 29, Issue 10-COct 2026

On the interplay between combinatorial designs and modern cryptography

S. Seethaladevi, Suraj Bhan, Dipti Ganesh Korwar, Sandhya Onkar Ahire, Ishita Gupta, V. Anantha Lakshmi

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3074

In this paper: Combinatorial designs are a mathematical basis to build secure and effective cryptographic systems. They allow randomness to be well structured, uniformly distributed, and highly diffused, which is cr...

AbstractReferencesFull Text PDF (534 KB)Views: 15Downloads: 7Citations: 0
Open Access Research Article·pp. 4583–4594·Vol. 29, Issue 10-COct 2026

Quantum-resistant cryptographic constructions using discrete structures

Pallavi Vilas Mhaske, Debanjana Prasad, Namrata Somnath Bajare, Rubi Kambo, D. Raghavendra Gowda, R. Shanthi

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3075

In this paper: Conventional cryptographic constructions have to meet the challenge of the quick development of quantum computing, and they require the creation of efficient constructions resistant to quantum attack....

AbstractReferencesFull Text PDF (569 KB)Views: 18Downloads: 9Citations: 0
Open Access Research Article·pp. 4595–4610·Vol. 29, Issue 10-COct 2026

Combinatorial game theory applications in cryptographic protocols

Mahadev Kalyanrao Patil, Archana Chaugule, Snehal Swapnil Jawahire, Varsha Kiran Patil, Aparna Shrinivas Shirkande, Neeraj Gupta

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3076

In this paper: These growing intricacy of cyber threats and the fast growth of interconnected digital systems have revealed the weaknesses of traditional cryptographic protocols basing their operation on fixed mathe...

AbstractReferencesFull Text PDF (857 KB)Views: 15Downloads: 11Citations: 0
Open Access Research Article·pp. 4611–4621·Vol. 29, Issue 10-COct 2026

A comprehensive study on the structural properties of distance-regular graphs and their applications in secure communication networks

Sachin Sakharam Gaikwad, G. Uma Maheswari, Srinivasulu Gogula, Vinay Shivajirao Nalawade, Amruta Tejaskumar Mokashi, A. Vanathi, Varun Kumar Sharma

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3077

In this paper: Distance-regular graphs are a highly symmetric form of graph, whose connectivity patterns are based equally on distance, and are used both in theory and practice. The structural properties of distance...

AbstractReferencesFull Text PDF (603 KB)Views: 11Downloads: 7Citations: 0
Open Access Research Article·pp. 4623–4636·Vol. 29, Issue 10-COct 2026

Security assessment of elliptic curve digital signature variants

Bijaya Kumar Sethi, Diksha Aggarwal, Kollathur Sudheer, Brijeshkumar M. Patel, Vinay Shivajirao Nalawade, Prerak Sudan

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3078

In this paper: In the dynamic landscape of securing online communication in the context of blockchain applications, Internet of Things (IoT) systems, and online shopping platforms, where integrity data, authenticati...

AbstractReferencesFull Text PDF (601 KB)Views: 8Downloads: 4Citations: 0
Open Access Research Article·pp. 4637–4646·Vol. 29, Issue 10-COct 2026

Advanced combinatorial approaches for designing robust key distribution schemes in distributed cryptographic systems

Shilpy Singh, Manisha Chandna, Dinesh Goyal, Manni Sruthi, Kumel K. Nagori, Tirukoti Sudha Rani

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3079

In this paper: Distributed cryptography has scalable and robust key distribution systems which are resource and adversarial bound. Some of the complex combinatorial constructions of powerful key distribution schemes...

AbstractReferencesFull Text PDF (656 KB)Views: 8Downloads: 7Citations: 0
Open Access Research Article·pp. 4647–4658·Vol. 29, Issue 10-COct 2026

Graph neural networks for cryptographic key prediction analysis

Tanya Singh, Ramesh Saini, Amit Kansal, Madireddy Sirisha, Preeti Pandurang Kale, Yagna B. Adhyaru

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3080

In this paper: The article addresses the growing challenge of analyzing the cryptographic key predictability in the era of the high-tech artificial intelligence and data-driven cybersecurity. Computational infeasibl...

AbstractReferencesFull Text PDF (594 KB)Views: 7Downloads: 5Citations: 0
Open Access Research Article·pp. 4659–4669·Vol. 29, Issue 10-COct 2026

Discrete logarithm problem over hyperelliptic curves : Computational complexity and cryptographic implications

Bijaya Kumar Sethi, Debanjana Prasad, Vivek Saraswat, Udita Goyal, Kasturi Rohini, Kartikkumar A. Patel

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3081

In this paper: HECC is a cryptography approach that builds upon classical discrete logarithm schemes, using Jacobians as its underlying group, and provides greater security per unit of key size but with different tr...

AbstractReferencesFull Text PDF (528 KB)Views: 7Downloads: 5Citations: 0
Open Access Research Article·pp. 4671–4682·Vol. 29, Issue 10-COct 2026

Construction of error-correcting codes from finite geometries and their applications in secure data storage systems

Simranjeet Nanda, Arsh Goyal, Karan Pandre, Arpita A. Prajapati, Tirukoti Sudha Rani, Hitendra Garg

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3082

In this paper: The fast expanding distributed and cloud-based storage systems have escalated the necessity to have strong error-correcting protocols that guarantee data integrity, reliability, and security. The conv...

AbstractReferencesFull Text PDF (682 KB)Views: 8Downloads: 7Citations: 0
Open Access Research Article·pp. 4683–4692·Vol. 29, Issue 10-COct 2026

On the application of hypergraph theory in modeling multi-party cryptographic protocols with enhanced security guarantees

G. Vijaya Kumar, Amit Kumar, Varya Agarwal, Khushboo, Pochampalli Deepthi, Nitinkumar M. Patel

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3083

In this paper: The paper discusses the application of hypergraph theory to the analysis of multi-party cryptographic protocols that can provide a high level of security. The traditional graph-based models fail to ca...

AbstractReferencesFull Text PDF (594 KB)Views: 11Downloads: 6Citations: 0
Open Access Research Article·pp. 4693–4704·Vol. 29, Issue 10-COct 2026

Algebraic and combinatorial methods for privacy-preserving authentication protocols in distributed ledger technologies

Dipak Sethi, Rani Nilesh Korde, Anoop Dev, Saumya Goyal, Rapaka Sudhir, Madasu Ashwan Kumar, Chetanaba G. Rajput

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3084

In this paper: DLTs are sensitive to having secure authentication to ensure privacy, scalability, and against advanced adversaries. The method involves the combination of finite field based key generation and encodi...

AbstractReferencesFull Text PDF (495 KB)Views: 9Downloads: 6Citations: 0
Open Access Research Article·pp. 4705–4718·Vol. 29, Issue 10-COct 2026

Investigation of expander graph families for designing highperformance cryptographic hash functions

Suraj Bhan, M. Janaki Rama Rao, Frederick Sidney Correa, Shobhit Goyal, Kamineni Sairam, Vikram V. Patel

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3085

In this paper: In current digital systems, such as blockchain, secure communications, and distributed computing environments, cryptographic hash functions are basic primitives to guarantee data integrity, authentica...

AbstractReferencesFull Text PDF (717 KB)Views: 6Downloads: 5Citations: 0
Open Access Research Article·pp. 4719–4730·Vol. 29, Issue 10-COct 2026

A novel framework for post-quantum cryptographic schemes based on lattice-theoretic and discrete optimization techniques

Gaganjot Kaur, Mandeep Kaur, Darapu Uma, M. Janaki Rama Rao, D. Balaji, Meghana Solanki

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3086

In this paper: 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...

AbstractReferencesFull Text PDF (920 KB)Views: 13Downloads: 9Citations: 0
Open Access Research Article·pp. 4731–4739·Vol. 29, Issue 10-COct 2026

Secure multi-party computation protocols based on discrete algebraic structures and finite group representations

Amardeep Kaur, Kamaljeet Kaur Mangat

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3087

In this paper: Secure Multi-Party Computation (SMPC) enables the various parties to collectively compute functions on sensitive inputs without the sensitive information being revealed, yet the problem of scalability...

AbstractReferencesFull Text PDF (568 KB)Views: 8Downloads: 7Citations: 0
Open Access Research Article·pp. 4741–4752·Vol. 29, Issue 10-COct 2026

Structural analysis and cryptanalytic evaluation of lightweight block ciphers using algebraic and differential techniques

Kamaljeet Kaur Mangat, Amardeep Kaur

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3088

In this paper: The rapid growth of resource-limited systems, such as the Internet of Things (IoT), embedded systems and wireless sensor networks has created a pressing need for efficient and secure cryptographic sch...

AbstractReferencesFull Text PDF (548 KB)Views: 5Downloads: 5Citations: 0
Open Access Research Article·pp. 4753–4763·Vol. 29, Issue 10-COct 2026

A comparative study of isogeny-based and elliptic curve cryptographic protocols for post-quantum secure applications

Prerana Nilesh Khairnar, Prashant Suryavanshi, Arti Suryavanshi, Archana Date, Rahul Raut, Pratibha Gayke

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3089

In this paper: The fast development of quantum computing presents a major challenge to classical public-key cryptographic systems and especially the Elliptic Curve Cryptography (ECC) which is based on the hardness o...

AbstractReferencesFull Text PDF (678 KB)Views: 10Downloads: 6Citations: 0
Open Access Research Article·pp. 4765–4773·Vol. 29, Issue 10-COct 2026

Deepfake threats in digital security : Detection and prevention mechanisms in networked environments

Vaibhav Banga, Netra Jain, Amit Hirawat, Rekha Jain, Arpana Sinhal

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3090

In this paper: Deepfake Technology is developed by both computer vision research and the deep learning that has evolved as a spin-off from the advances made in this area. Deepfakes are classified as artificial digit...

AbstractReferencesFull Text PDF (490 KB)Views: 10Downloads: 6Citations: 0
Open Access Research Article·pp. 4775–4786·Vol. 29, Issue 10-COct 2026

A hybrid cryptographic framework with machine learning-based anomaly detection for secure network traffic using UNSW-NB15

Swami Nisha Bhagirath, Bindiya Jain, Pragya Singh, Vaibhav Bhavnagar, Rajesh Handa

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3091

In this paper: The advancement of technology is changing digital communication systems rapidly. The development of network topologies is equally growing. Both trends have led to an increase in the number of cyber th...

AbstractReferencesFull Text PDF (1.2 MB)Views: 14Downloads: 8Citations: 0
Open Access Research Article·pp. 4787–4794·Vol. 29, Issue 10-COct 2026

Adaptive semantic guardrails : Dynamic magic square obfuscation as a positional cipher for NL2SQL environments

Rahul Kumar Sharma, Vivek Kapoor

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3092

In this paper: Natural Language to SQL (NL2SQL) interfaces has made data far more accessible, but they have also opened up a new kind of weakness we call “Semantic Drift.” Because these systems are probabilistic, a...

AbstractReferencesFull Text PDF (573 KB)Views: 6Downloads: 5Citations: 0