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-A·October 2026·31 ArticlesSpecial Issue

Volume 29, Issue 10-A

Articles

Open Access ·pp. i–vii·Vol. 29, Issue 10-AOct 2026

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

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-A-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 (124 KB)Views: 21Downloads: 10Citations: 0
Open Access Research Article·pp. 3713–3725·Vol. 29, Issue 10-AOct 2026

Chaotic polynomial sequences for high-entropy stream ciphers

D. Balaji, Tanya Singh, Nikhil Mohan Shinde, Rajesh Kumar Tripathi, V. Dhanalakshmi, Kathirisetty Nikhila

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

In this paper: The chaotic sequences of polynomials have a promising but underutilized basis on the design of high-entropy stream ciphers, to mitigate constraints of predictability and low randomness in the design o...

AbstractReferencesFull Text PDF (508 KB)Views: 14Downloads: 9Citations: 0
Open Access Research Article·pp. 3727–3738·Vol. 29, Issue 10-AOct 2026

Cryptographic indexing schemes for encrypted scientific databases

Shweta S. Aladakatti, Bondada Venkata Ramana, Vijaysinh U. Bansude, Shwetambari Pandurang Katake, M. Keerthana, Subhash Chand Agrawal

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

In this paper: The spread of encrypted scientific information archives has posed an urgent need of retrieval systems that can maintain privacy of data and at the same time provide a pragmatic query efficiency. Tradi...

AbstractReferencesFull Text PDF (715 KB)Views: 15Downloads: 9Citations: 0
Open Access Research Article·pp. 3739–3749·Vol. 29, Issue 10-AOct 2026

Graph-partition-based attack mitigation in dense mesh networks

Sangeeta Vhatkar, Rupali Mane, Sukruti Kaulgud, Asmita Bhupesh Marathe, Anand Arvind Maha, Zahir Aalam

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

In this paper: The attack mitigation technique, presented as graph-partition scheme, enhances the resistance of dense mesh communication network to the fast spreading cyber-attacks. The research work presents an ada...

AbstractReferencesFull Text PDF (596 KB)Views: 21Downloads: 14Citations: 0
Open Access Research Article·pp. 3751–3763·Vol. 29, Issue 10-AOct 2026

Code-based signature schemes for long-term archival documents

Kasturi Rohini, Chetanaba G. Rajput, Manoj Verghese, Manpreet Singh, Saumya Goyal, Shardha Purohit

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

In this paper: The role of code-based signature schemes is increasingly significant in long-term archival documents, in which the traditional cryptographic systems would be threatened with becoming obsolete because...

AbstractReferencesFull Text PDF (708 KB)Views: 13Downloads: 11Citations: 0
Open Access Research Article·pp. 3765–3775·Vol. 29, Issue 10-AOct 2026

Topological simplification methods for large-scale knowledge graphs

Mohanad Alfiras, Mohammed Hasan Aldulaimi, Mrunmai Mandar Ranade, Gagan Tiwari, M. Vinitha, Eshniyozov Asadbek, Saodatkhon Ibragimova

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

In this paper: Topological simplification of large-scale knowledge graphs seeks to simplify the structure of knowledge graphs with minimal semantic loss and query time. The paper gives a detailed methodology on redu...

AbstractReferencesFull Text PDF (504 KB)Views: 12Downloads: 10Citations: 0
Open Access Research Article·pp. 3777–3790·Vol. 29, Issue 10-AOct 2026

Probabilistic analysis of threshold cryptography for cloud storage

Shabina Jameer Modi, Karuna S. Bhosale, Archana Ganesh Said, Samir N. Ajani, Ashok Bhansali, Pushpa Nagini Sripada

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

In this paper: Threshold cryptography provides a more secure method of ensuring the cloud storage, through sharing cryptographic keys with a number of participants, none of whom can have the system compromised. The...

AbstractReferencesFull Text PDF (689 KB)Views: 16Downloads: 12Citations: 0
Open Access Research Article·pp. 3791–3801·Vol. 29, Issue 10-AOct 2026

Number-theoretic foundations of attribute-based encryption schemes

Mohanad Alfiras, M. Thamizhsudar, Amit Gaurav, Manisha Sagar Pawar, Manish Chhabra, Sardor Sabirov

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

In this paper: Attribute Based Encryption (ABE) has become a potent concept of access control on a fine-grained basis in a distributed and cloud setting. The paper will delve into number theoretic underpinnings of t...

AbstractReferencesFull Text PDF (575 KB)Views: 15Downloads: 10Citations: 0
Open Access Research Article·pp. 3803–3814·Vol. 29, Issue 10-AOct 2026

Graph-theoretic approaches to post-quantum cryptographic protocols

S. Gayathri, Vundela Swathi, Mohammed Hasan Aldulaimi, Sarvinoz Kasimova, Qobil Hayitov, Erdonov Bekmurod

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

In this paper: The fast development of quantum computing poses a threat to the security of the classical cryptographic system, and so there is a need to have strong post-quantum systems that are hard to break. The i...

AbstractReferencesFull Text PDF (579 KB)Views: 11Downloads: 9Citations: 0
Open Access Research Article·pp. 3815–3826·Vol. 29, Issue 10-AOct 2026

Algebraic structures for lightweight block cipher design

Ambi Rachel Alex, Bipin Sule, Megha Jagga, Bodireddy Vamalatha, Shubhi Goyal, Gagan Tiwari

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

In this paper: Securing resource constrained devices such as IoT, embedded or wireless sensor devices requires lightweight cryptographic mechanisms. An algebraic method for designing light-weight block ciphers which...

AbstractReferencesFull Text PDF (617 KB)Views: 18Downloads: 7Citations: 0
Open Access Research Article·pp. 3827–3838·Vol. 29, Issue 10-AOct 2026

Number-theoretic foundations of post-quantum cryptographic protocols

Osama Al Rawi, M. Thamizhsudar, N. Nivetha, Vikram V. Patel, Mrunmai Mandar Ranade, Alisher Abduvokhidov, Sardor Sabirov

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

In this paper: Conventional cryptographic systems such as factorization and discrete logarithm problems are threatened by the quick development of quantum computing. This paper offers a thorough study of number-theo...

AbstractReferencesFull Text PDF (642 KB)Views: 9Downloads: 10Citations: 0
Open Access Research Article·pp. 3839–3850·Vol. 29, Issue 10-AOct 2026

Error-correcting code embedding for confidential edge storage

Vikram V. Patel, Shobhit Goyal, Puli Lavanya, Rupali Adhau, Sushil Punwatkar, Sakshi Pandey

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

In this paper: At the network edge, confidential data storage requires a highly resilient noise, failure, and adversarial-access protection and low computation overhead. This paper introduces an error-correcting cod...

AbstractReferencesFull Text PDF (684 KB)Views: 12Downloads: 10Citations: 0
Open Access Research Article·pp. 3851–3862·Vol. 29, Issue 10-AOct 2026

Graph-theoretic approaches to lightweight block cipher design

Hemlata Uday Karne, Puneet Kumar Yadav, Vipulkumar M. Dabhi, R. Snehaa, M. Vinitha, Manish Chhabra

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

In this paper: In IoT and embedded systems, small devices require lightweight block ciphers to provide security without being too costly in terms of computation. In this paper, a graph-theoretic lightweight block ci...

AbstractReferencesFull Text PDF (723 KB)Views: 14Downloads: 15Citations: 0
Open Access Research Article·pp. 3863–3874·Vol. 29, Issue 10-AOct 2026

Algebraic curve constructions for lightweight key establishment

Pratibha V. Kashid, Sahil Khurana, Shivangi Gupta, Sandip Shriniwas Kulkarni, S. Loganathan, D. Balaji

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

In this paper: In the context of Internet of Things (IoT) and embedded and low power wireless systems, lightweight key establishment mechanisms are essential for secure communications. This paper proposes an algebra...

AbstractReferencesFull Text PDF (583 KB)Views: 16Downloads: 11Citations: 0
Open Access Research Article·pp. 3875–3886·Vol. 29, Issue 10-AOct 2026

Algebraic frameworks for transparent cryptographic systems

Amit Kumar Bhanja, Madasu Ashwan Kumar, Gaikwad Vidya Shrimant, Tirukoti Sudha Rani, Manoj I. Patel, D. Balaji

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

In this paper: Cryptographic systems are transparent to achieve trade-offs between high security and verifiability and interpretability, and do so through the use of rigorous algebraic structures. The paper gives a...

AbstractReferencesFull Text PDF (927 KB)Views: 20Downloads: 10Citations: 0
Open Access Research Article·pp. 3887–3898·Vol. 29, Issue 10-AOct 2026

Lattice-based homomorphic encryption for privacy-preserving medical analytics

Mayuri H. Molawade, Prabhat Sharma, Kukatla Tejesh, Samaksh Goyal, Vipulkumar M. Dabhi, Yazdani Hasan

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

In this paper: The medical analytics that protect privacy has gained urgency as the amount of sensitive healthcare information has been increasing rapidly and regulatory restrictions are imposed. The present paper p...

AbstractReferencesFull Text PDF (516 KB)Views: 19Downloads: 9Citations: 0
Open Access Research Article·pp. 3899–3912·Vol. 29, Issue 10-AOct 2026

Lightweight post-quantum cryptography for energy-constrained wireless sensor networks

Ritesh Shrivastav, Prajwal Gaikwad, Ravi Thangjam, G. Vijaya Kumar, Amruta Prasad Kharade, Preeti Pandurang Kale

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

In this paper: The very fast development of quantum computing is a serious threat to traditional cryptographic solutions that are used in wireless sensor networks (WSNs), especially those that have severe energy and...

AbstractReferencesFull Text PDF (708 KB)Views: 19Downloads: 14Citations: 0
Open Access Research Article·pp. 3913–3924·Vol. 29, Issue 10-AOct 2026

Secure cross-border medical data exchange using post-quantum cryptography

Manish K. Assudani, Swati Shivkumar Shriyal, Prabhat Sharma, Nagireddy Mounika, Samaksh Goyal, Vipulkumar M. Dabhi

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

In this paper: The privacy threat, cross-border regulatory differences, and emerging quantum threat are critical challenges to secure cross-border medical data exchange. The present paper suggests a post-quantum cry...

AbstractReferencesFull Text PDF (648 KB)Views: 12Downloads: 11Citations: 0
Open Access Research Article·pp. 3925–3936·Vol. 29, Issue 10-AOct 2026

Algebraic cryptographic primitives for secure IoT data aggregation

Yogesh Dinkar Jadhav, Jyotsna Suryavanshi, Padmavati Shrivastava, Pawan Arunkumar Upadhye, Megha Jagga, K. Parimala

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

In this paper: The rapid growth of Internet of things (IoT) networks requires the effective and secure data aggregation systems that would maintain the confidentiality and provide real-time analytics. The present pa...

AbstractReferencesFull Text PDF (515 KB)Views: 15Downloads: 11Citations: 0
Open Access Research Article·pp. 3937–3949·Vol. 29, Issue 10-AOct 2026

Homomorphic encryption–enabled AI processing for IoT security

Mayuri H. Molawade, Dhanashree Pisal, Prasad M. Patare, Sandhya Onkar Ahire, Sourabh Guha, Shubhi Goyal

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

In this paper: The growth of the Internet of Things (IoT) networks brings with it a number of issues when it comes to safeguarding sensitive data in the context of Artificial Intelligence (AI) based data processing....

AbstractReferencesFull Text PDF (529 KB)Views: 16Downloads: 7Citations: 0
Open Access Research Article·pp. 3951–3961·Vol. 29, Issue 10-AOct 2026

AI-driven early warning systems for IoT cyber threats

Abhiraj Bhaskar Ubale, Vijay Kotkar, Sayali D. Joshi, Milind S. Patil, Puneet Kumar Yadav, V. S. N. Kumar

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

In this paper: Internet of Things (IoT) ecosystems has been associated with serious cybersecurity threats due to the heterogeneous nature, dynamism in connectivity, and poor computing abilities. The present paper pr...

AbstractReferencesFull Text PDF (468 KB)Views: 12Downloads: 9Citations: 0
Open Access Research Article·pp. 3963–3972·Vol. 29, Issue 10-AOct 2026

Graph homomorphisms and applications to network coding

Avinash B. Raut, Avinash Bansidhar Thakare, Sudhir Tukaram Surase, B. Kshirsagar Kiran, S. R. Shaikh, Machindranath B. Diwate

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

In this paper: Graph homomorphism have been utilized as a highly powerful mathematical tool to map the complex topologies of networks to simpler ones and still be able to retain adjacency relations. This article foc...

AbstractReferencesFull Text PDF (596 KB)Views: 19Downloads: 12Citations: 0
Open Access Research Article·pp. 3973–3983·Vol. 29, Issue 10-AOct 2026

Hamiltonicity conditions in random graph models

S. Gayathri, Latika Rahul Desai, Bodireddy Vamalatha, Himanshu Sharma, Manjula Devarakonda Venkata, Megha Jagga

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

In this paper: Hamiltonicity of random graphs Probabilistic combinatorics: Hamiltonicity is a focal point of probabilistic combinatorics, the cross-relationship between structural graph phenomena and threshold pheno...

AbstractReferencesFull Text PDF (640 KB)Views: 10Downloads: 11Citations: 0
Open Access Research Article·pp. 3985–3996·Vol. 29, Issue 10-AOct 2026

Dominating sets in hierarchical sensor networks

Mrunmai Mandar Ranade, S. Gayathri, Gagan Tiwari, Vundela Swathi, Shitij Goyal, Ravi Kumar

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

In this paper: The sets that take over are important as well in resource use and the effectiveness of communication in a hierarchical sensor network. The current paper presents a multi-level dominating set model whi...

AbstractReferencesFull Text PDF (807 KB)Views: 12Downloads: 10Citations: 0
Open Access Research Article·pp. 3997–4007·Vol. 29, Issue 10-AOct 2026

A lightweight block cipher based on combinatorial substitution structures

Afreen Rahmat Khatoon, Mohammed Wahed Ali Khan, Hafiz Munaam Hussain Tariq, Tahreem Khan

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

In this paper: The growing need to provide secure communication in lightweight but resource-constrained systems like Internet of Things (IoT) and embedded systems, requires the development of lightweight and yet pow...

AbstractReferencesFull Text PDF (730 KB)Views: 16Downloads: 10Citations: 0
Open Access Research Article·pp. 4009–4019·Vol. 29, Issue 10-AOct 2026

Algebraic construction of secure S-boxes using finite fields

Deepak Kumar, Kothakonda Sairam, V. S. N. Kumar, D. Balaji, Lokesh Verma, Pooja Dilip Morey

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

In this paper: S-Boxes are important devices in the current cryptographic systems, which guarantee confusion and antagonism against attacks. This article extends a mathematical model of the building of resilient S-B...

AbstractReferencesFull Text PDF (488 KB)Views: 17Downloads: 13Citations: 0
Open Access Research Article·pp. 4021–4032·Vol. 29, Issue 10-AOct 2026

Cryptographic protocols based on graph isomorphism hardness

Prabhat Sharma, M. Radhika Mani, Mahesh M. Zade, I. Durga Bhavani, R. Snehaa, Kasturi Rohini

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

In this paper: Graph isomorphism (GI) has turned out to be an attractive basis of the construction of secure cryptographic protocols because it has a special set of computational hardness properties, not in the clas...

AbstractReferencesFull Text PDF (738 KB)Views: 16Downloads: 9Citations: 0
Open Access Research Article·pp. 4033–4044·Vol. 29, Issue 10-AOct 2026

Applications of group actions in symmetric cryptosystems

Nikhil Govil, K. Keerthika, Sakshi Sobti, Manni Sruthi, Dilshod Raupov, A. K. Bhuvaneswari

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

In this paper: A strict algebraic structure of group actions models the symmetry, permutation and transformation properties in symmetric cryptosystems. In this paper, the reasons why permutation groups are critical...

AbstractReferencesFull Text PDF (792 KB)Views: 11Downloads: 9Citations: 0
Open Access Research Article·pp. 4045–4054·Vol. 29, Issue 10-AOct 2026

Semiring-based models for secure data aggregation

Hafiz Munaam Hussain Tariq, Tahreem Khan, Afreen Rahmat Khatoon, Mohammed Wahed Ali Khan

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

In this paper: In distributed systems like the Internet of Things (IoT), wireless sensor networks, and cloud-based systems, secure data aggregation is essential as the integrity of data, its confidentiality, and eff...

AbstractReferencesFull Text PDF (436 KB)Views: 14Downloads: 7Citations: 0
Open Access Research Article·pp. 4055–4064·Vol. 29, Issue 10-AOct 2026

Ideal structure of polynomial rings over finite fields

Jay Prakash Tiwari, D. Balaji, Swagat M. Karve, Mridul Dixit, Preeti Pandurang Kale, Baru Prashanthi

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

In this paper: The paper discusses the best form of the polynomial rings on the finite fields with a consideration on their algebraic properties and their applications in the modern day algebra. With the assumption...

AbstractReferencesFull Text PDF (1.0 MB)Views: 19Downloads: 9Citations: 0
Open Access Research Article·pp. 4065–4074·Vol. 29, Issue 10-AOct 2026

Post-quantum cryptographic schemes using lattice problems

Mohammed Wahed Ali Khan, Afreen Rahmat Khatoon, Hafiz Munaam Hussain Tariq, Tahreem Khan

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

In this paper: The quick progress of quantum computing is a considerable risk to the classical cryptography of the public key and, the creation of quantum-resistant analogs is necessary. This paper provides a genera...

AbstractReferencesFull Text PDF (578 KB)Views: 14Downloads: 9Citations: 0