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
Special Issue

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

Volume 29, Issue 10-B·October 2026·31 articles

Articles

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

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

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-B-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: 14Downloads: 11Citations: 0
Open Access Research Article·pp. 4075–4085·Vol. 29, Issue 10-BOct 2026

Boolean function optimization for stream cipher design

K. Madhura, Bipin Sule, Sumeet Singh Sarpal, A. K. Bhuvaneswari, Saumya Goyal, Yagna B. Adhyaru

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

In this paper: The design of secure and efficient stream ciphers heavily relies on the use of the Boolean functions, which affect the nonlinearity, correlation immunity, and algebraic complexity. The current paper g...

AbstractFull Text PDF (668 KB)Views: 9Downloads: 8Citations: 0
Open Access Research Article·pp. 4087–4096·Vol. 29, Issue 10-BOct 2026

Homomorphic encryption based on modular arithmetic structures

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

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

In this paper: A modular arithmetic structure of homomorphic encryption enables the capability to perform computation on encrypted data without revealing any information on plaintext, and hence it is highly suitable...

AbstractReferencesFull Text PDF (886 KB)Views: 14Downloads: 5Citations: 0
Open Access Research Article·pp. 4097–4107·Vol. 29, Issue 10-BOct 2026

Chaos-based image encryption using discrete maps

Ritesh Shrivastav, Latika Rahul Desai, Saniya Khurana, Lokesh Ravilla, Shobhit Goyal, Fazil Hasan

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

In this paper: Image encryption using chaos has become an effective method of protecting digital visual information because of its high sensitivity, randomness and nonlinear nature. The current paper outlines a disc...

AbstractReferencesFull Text PDF (550 KB)Views: 10Downloads: 6Citations: 0
Open Access Research Article·pp. 4109–4119·Vol. 29, Issue 10-BOct 2026

Cryptographic hash functions derived from expander graphs

Dipti Yashodhan Sakhare, Yogesh Shankarrao Lonkar, M. Raghavendra, S. Rama Sree, S. Loganathan, Preeti Pandurang Kale

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

In this paper: In modern-day digital systems, cryptographic hash functions can be highly important in providing data integrity, authentication and security. They present in this paper a new model of constructing has...

AbstractReferencesFull Text PDF (751 KB)Views: 9Downloads: 7Citations: 0
Open Access Research Article·pp. 4121–4131·Vol. 29, Issue 10-BOct 2026

Linear approximation attacks on reduced-round block ciphers

Swapnil Sonawane, Dilip Motwani, Vidya Chitre, Amit Nerurkar, Varsha Bhosale, Rugved Deolekar

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

In this paper: Linear cryptanalysis is still a key method to analyze the security of symmetric-key primitives, especially reduced-round block ciphers, in which structural weaknesses are more revealed. This paper exa...

AbstractReferencesFull Text PDF (493 KB)Views: 17Downloads: 9Citations: 0
Open Access Research Article·pp. 4133–4143·Vol. 29, Issue 10-BOct 2026

Algebraic attacks on multivariate public key cryptosystems

Mandeep Kaur, Gaganjot Kaur, D. Sathis Kumar, Samir N. Ajani, Ramesh Dhulipudi, Rahul A. Padgilwar

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

In this paper: One promising post-quantum security candidate is Multivariate Public Key Cryptosystems (MPKCs); they are susceptible to algebraic attacks. In this paper, I will discuss the vulnerability of MPKCs to h...

AbstractReferencesFull Text PDF (501 KB)Views: 11Downloads: 8Citations: 0
Open Access Research Article·pp. 4145–4155·Vol. 29, Issue 10-BOct 2026

Combinatorial design theory for the development of threshold secret sharing schemes in cloud-based environments

Nisha Wankhade, Amit Gaurav, S. Srinivas Reddy, Neeraj Varshney, Mirzohid Ernazarov, Bekzod. Madaminov, Payal Sunil Lahane

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

In this paper: Cloud-based data management systems should have strong data handling mechanisms that discourage unauthorized access and provide effective data recovery. The issue that the present paper will address i...

AbstractReferencesFull Text PDF (469 KB)Views: 8Downloads: 6Citations: 0
Open Access Research Article·pp. 4157–4167·Vol. 29, Issue 10-BOct 2026

Cryptanalysis of permutation-based image encryption algorithms

Praniti Ram Patil, Saurav Verma, Vivian Lobo, Aakash Mansaram Gojare, Nirmala Kamble, Suresh Singh Rajpurohit

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

In this paper: Image encryption algorithms based on permutation-based algorithms are being common since they are simple and fast to compute but their security is a major issue when subjected to a high level of crypt...

AbstractReferencesFull Text PDF (544 KB)Views: 25Downloads: 11Citations: 0
Open Access Research Article·pp. 4169–4178·Vol. 29, Issue 10-BOct 2026

Fault injection attacks on finite field arithmetic implementations

Aabha Amey Patil, Nilesh Jagdish Vispute, Uma Bhavin Goradiya, Prachi Wagde, Swapna Nikhil Ambekar, Saurav Verma

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

In this paper: Fault injection attacks are a major threat on the reliability and security of cryptographic systems using finite field arithmetic. This paper explores how arithmetic processes like addition, multiplic...

AbstractReferencesFull Text PDF (597 KB)Views: 18Downloads: 8Citations: 0
Open Access Research Article·pp. 4179–4188·Vol. 29, Issue 10-BOct 2026

Number-theoretic transformations in public key encryption

M. Thamizhsudar, Tanveer Ahmad Wani, Savinder Kaur, Mahendihasan S. Heera, B. Anandkumar, Vella Satyanarayana

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

In this paper: NTTs have proven to be an important calculator in modern public key encryption, particularly in lattice-based and post-quantum cryptography. Mathematical backgrounds and algorithms implementations of...

AbstractReferencesFull Text PDF (505 KB)Views: 9Downloads: 7Citations: 0
Open Access Research Article·pp. 4189–4199·Vol. 29, Issue 10-BOct 2026

Modular forms and their role in cryptographic constructions

Tanveer Ahmad Wani, A. K. Bhuvaneswari, Swati Shivkumar Shriyal, Tusha, Yagna B. Adhyaru, Abrayev Baxrom

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

In this paper: The paper is concerned with the necessity of new cryptographic systems on classical assumptions and the issue of the secure, quantum resistant communication systems. It suggests a cryptography scheme...

AbstractReferencesFull Text PDF (546 KB)Views: 8Downloads: 7Citations: 0
Open Access Research Article·pp. 4201–4211·Vol. 29, Issue 10-BOct 2026

Secure pairing-based cryptographic protocols

Suresh Singh Rajpurohit, Aabha Amey Patil, Nilesh Jagdish Vispute, Uma Bhavin Goradiya, Prachi Wagde, Swapna Nikhil Ambekar

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

In this paper: The secure pairing cryptographic protocols have become a strong paradigm to offer possessing security facilities of high level including identity-based encryptions, short signature and an effective ke...

AbstractReferencesFull Text PDF (543 KB)Views: 16Downloads: 7Citations: 0
Open Access Research Article·pp. 4213–4224·Vol. 29, Issue 10-BOct 2026

Ring-theoretic analysis of error-correcting codes

R. Shantha Mary Joshitta, Sachin Sakharam Gaikwad, Saumya Goyal, Narendra Mohan, S. Suganya, Namrata Somnath Bajare

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

In this paper: Checking codes play a role in ensuring credibility in delivering information in the noisy communication channels. The paper is a detailed ring-theoretic analysis of error-correcting codes, in the alge...

AbstractReferencesFull Text PDF (646 KB)Views: 12Downloads: 12Citations: 0
Open Access Research Article·pp. 4225–4236·Vol. 29, Issue 10-BOct 2026

Boolean function analysis for enhancing nonlinearity and resistance against linear and differential cryptanalysis

Aitha Srividya, Samaksh Goyal, Yazdani Hasan, Sanjesh Sadanand Pawale, Shakhboz Meylikulov, Chetansinh R. Vaghela, Umidjon Musaev

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

In this paper: The analysis of Boolean functions is a core part of the design of secure cryptographic primitives, especially to make them more resistant to linear and differential cryptanalysis. This work explores f...

AbstractReferencesFull Text PDF (600 KB)Views: 9Downloads: 7Citations: 0
Open Access Research Article·pp. 4237–4247·Vol. 29, Issue 10-BOct 2026

Statistical attacks on pseudorandom number generators

K. Madhura, Banothu Vijay, Anisha Chaudhary, Vimal Bibhu, Sardor Buriyev, Mutabar Latipova

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

In this paper: The statistical attacks on pseudorandom number generators (PRNGs) expose vulnerability of the deterministic nature of the structure of the generators. This paper discusses mathematical concepts which...

AbstractReferencesFull Text PDF (593 KB)Views: 11Downloads: 7Citations: 0
Open Access Research Article·pp. 4249–4259·Vol. 29, Issue 10-BOct 2026

Algebraic graph theory in secure communication design

Tanveer Ahmad Wani, Nitinkumar M. Patel, Kotte Navya, Samir N. Ajani, Prakhar Goyal, Sanjesh Sadanand Pawale

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

In this paper: The algebraic graph theory has a framework to study and construct secure communication systems based on a combination of structural graph properties, spectral graph properties and cryptographic concep...

AbstractReferencesFull Text PDF (671 KB)Views: 7Downloads: 4Citations: 0
Open Access Research Article·pp. 4261–4272·Vol. 29, Issue 10-BOct 2026

Discrete logarithm problem in hyperelliptic curve groups

Shweta S. Aladakatti, Vikram V. Patel, Rahul Rajendra Papalkar, Harshada Bhushan Magar, Veerendra Yadav, Syed Farhan

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

In this paper: The Discrete Logarithm Problem in Hyperelliptic Curve Groups (HECDLP) is a fundamental basis to more advanced cryptographic systems, and is more secure per key size than classical techniques using ell...

AbstractReferencesFull Text PDF (480 KB)Views: 8Downloads: 7Citations: 0
Open Access Research Article·pp. 4273–4288·Vol. 29, Issue 10-BOct 2026

Matrix group representations in cryptographic transformations

Sachin Arun Thanekar, Devata R. Anekar, Ranjeetsingh Suryawanshi, Anuradha Narendra Nawathe, Yogesh Shepal, G. Kavitha, Monali Gulhane

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

In this paper: The growing need of safe data transmission in the contemporary digital setting, such as cloud-based, Internet of Things (IoT), and distributed systems, has revealed the weaknesses of the traditional c...

AbstractReferencesFull Text PDF (1.6 MB)Views: 15Downloads: 9Citations: 0
Open Access Research Article·pp. 4289–4298·Vol. 29, Issue 10-BOct 2026

Torsion subgroups and their cryptographic implications

Pragati Dubey, Dewanand Atmaram Meshram, Rekha A Kulkarni, Amruta Vijay Surana, Khushal Khairnar, Kalyani Ghuge, Chandrakant Deelip Kokane

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

In this paper: Torsion subgroups are important in algebraic structures, and in the current cryptographic systems, especially elliptic curve systems. In this paper the theoretical background of the torsion subgroups...

AbstractReferencesFull Text PDF (675 KB)Views: 20Downloads: 8Citations: 0
Open Access Research Article·pp. 4299–4308·Vol. 29, Issue 10-BOct 2026

Enumeration and classification of self-dual codes over finite rings with applications in cryptographic systems

Veerendra Yadav, Amruta Prasad Kharade, Tusha, Lokesh Ravilla, Chetanaba G. Rajput, Gourav Bathla

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

In this paper: Self-dual codes of finite rings have now become powerful tools of algebraic design which are important in modern cryptography. A systematic enumeration and classification plan of self-dual codes deter...

AbstractReferencesFull Text PDF (877 KB)Views: 9Downloads: 6Citations: 0
Open Access Research Article·pp. 4309–4320·Vol. 29, Issue 10-BOct 2026

Discrete algebraic methods in secure distributed systems

Vinod V. Kimbahune, Chudaman Devidasrao Sukte, Neeta Deshpande, Umesh Raut, Suhas Chavan, Aarti S. Gaikwad, Chandrakant Deelip Kokane

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

In this paper: The use of distributed systems in various fields, which has grown up, including cloud computing, IoT, and decentralized networks, has compounded the necessity to have an effective and robust security...

AbstractReferencesFull Text PDF (1.3 MB)Views: 18Downloads: 6Citations: 0
Open Access Research Article·pp. 4321–4331·Vol. 29, Issue 10-BOct 2026

Efficient scalar multiplication techniques on elliptic curves

Bhawani Sankar Panigrahi, Rahul Kumar Singh, Praney Madan, Nyalam Ramu, Anisha Chaudhary, Manoj I. Patel

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

In this paper: The elliptic curve cryptography is based upon the efficient scalar multiplication, which directly affects the performance and security of a calculation. The article is an in-depth analysis of the adva...

AbstractReferencesFull Text PDF (584 KB)Views: 10Downloads: 6Citations: 0
Open Access Research Article·pp. 4333–4345·Vol. 29, Issue 10-BOct 2026

Authentication schemes using combinatorial key distribution

Shivangi Gupta, Pramod Reddy, Uma Bhardwaj, Makineedi Raja Babu, Rayudu Sowmya, Bajarang Prasad Mishra

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

In this paper: As the Internet of Things (IoT) and wireless sensor networks (WSNs increase, the issue of security and efficient authentication of these networks is one of the burning questions. The classical authent...

AbstractReferencesFull Text PDF (681 KB)Views: 10Downloads: 7Citations: 0
Open Access Research Article·pp. 4347–4356·Vol. 29, Issue 10-BOct 2026

Elliptic curve cryptography over binary extension fields

Mohammad Shkoukani, Namrata Gain, Vikram V. Patel, Manjushree Ram Ghogare, Bodireddy Vamalatha, Priyanka Shashikant Kshirsagar

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

In this paper: Binary extension field-based Elliptic Curve Cryptography (ECC) offers secure and efficient capabilities to resource-constrained systems such as embedded systems and IoT. In this paper, a specific rese...

AbstractReferencesFull Text PDF (600 KB)Views: 13Downloads: 9Citations: 0
Open Access Research Article·pp. 4357–4368·Vol. 29, Issue 10-BOct 2026

Secure data hiding via discrete wavelet transform techniques

Shubhangi Babasaheb Patil, Sagar Vasantrao Joshi, Trupti Narayan Pawase, Vaishnaw G. Kale, Deepak Balaso Patil, Amol Bapuso Rajmane

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

In this paper: As digital communication and multimedia data exchange develops at an extremely fast pace, the importance of confidentiality and integrity of the information relayed has become even more important. Ima...

AbstractReferencesFull Text PDF (936 KB)Views: 15Downloads: 13Citations: 0
Open Access Research Article·pp. 4369–4381·Vol. 29, Issue 10-BOct 2026

Isogeny-based cryptosystems for post-quantum security

R. A. Kapgate, Dheeravath Raju, Chetansinh R. Vaghela, Neema Sajju Balan, Amol Barde, Krishna Chaitanya Pidugu

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

In this paper: The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe post-quantum schemes. One of...

AbstractReferencesFull Text PDF (763 KB)Views: 11Downloads: 6Citations: 0
Open Access Research Article·pp. 4383–4395·Vol. 29, Issue 10-BOct 2026

Combinatorial approaches to privacy-preserving data mining

Sourabh Rungta, Nimesh Raj, Nagireddy Mounika, Varsha Kiran Patil, Manisha Tushar Jadhav, Chetansinh R. Vaghela

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

In this paper: The rapidly increasing number of data-driven applications in various fields like healthcare, finance, and smart governance has raised the issue of privacy and security of sensitive information when mi...

AbstractReferencesFull Text PDF (735 KB)Views: 10Downloads: 7Citations: 0
Open Access Research Article·pp. 4397–4406·Vol. 29, Issue 10-BOct 2026

Efficient scalar multiplication algorithms on elliptic curves over prime fields for resource-constrained cryptographic devices

M. Sreenivasa Reddy, Fazil Hasan, Shivangi Gupta, Shivam P. Chaudhary, Manisha Sagar Pawar, Shaziya Islam

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

In this paper: Although Elliptic Curve Cryptography (ECC) over prime fields is computationally efficient in many cryptographic operations, scalar multiplication remains a computational bottleneck, particularly in re...

AbstractReferencesFull Text PDF (521 KB)Views: 9Downloads: 6Citations: 0
Open Access Research Article·pp. 4407–4416·Vol. 29, Issue 10-BOct 2026

Threshold cryptography for distributed ledger systems

Budigi Prabhakar, Takveer Singh, Neelabh Sao, Kothakonda Sairam, Sulabha Narendra Patil, Rajendra Vasantrao Patil

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

In this paper: Threshold cryptography has emerged as a promising approach to enhance security, decentralization and fault tolerance in distributed ledger systems. The paper discusses the implementation of threshold...

AbstractReferencesFull Text PDF (657 KB)Views: 7Downloads: 7Citations: 0
Open Access Research Article·pp. 4417–4428·Vol. 29, Issue 10-BOct 2026

Secure routing in wireless networks using dominating sets

Satish Changdeo Cholke, Anvesha Garg, Vundela Swathi, Tripti Sharma, Kiran D. Parmar, Pushpa Nagini Sripada

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

In this paper: Wireless networks, like wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs), are an essential part of the modern communication systems and serve purposes, such as IoT, smart cities, an...

AbstractReferencesFull Text PDF (1.1 MB)Views: 10Downloads: 7Citations: 0