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
Volume 28·Issue 3·April 2025·25 Articles

Volume 28, Issue 3

Articles

Open Access Research Article·pp. 631–639·Vol. 28, Issue 3Apr 2025

A modified ElGamal-like cryptosystem

Rajitha Ranasinghe, Pabasara Athukorala, Pramodya Athurugiriya

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-1723

In this paper: The ElGamal cryptosystem stands as one of the foremost public key encryption methods and represents a probabilistic algorithm, originating from the framework of the Diffie-Hellman key exchange protoco...

AbstractReferencesFull Text PDF (159 KB)Views: 381Downloads: 76Citations: 0
Open Access Research Article·pp. 653–665·Vol. 28, Issue 3Apr 2025

Computing Y-index of V-phenylenic nanostructures

Yusuf Zeren, Abdu Alameri, Mutlu Akar, Mohammed Alsharafi

Published Online: 18 Apr 2025DOI: 10.47974/JDMSC-1832

In this paper: Topological measures of molecular graph structure according to degree yield valuable tools that facilitate understanding material’s characteristics through their structures involving physical, chemica...

AbstractReferencesFull Text PDF (702 KB)Views: 196Downloads: 74Citations: 0
Open Access Research Article·pp. 685–699·Vol. 28, Issue 3Apr 2025

Fractional integral Hermite-Hadamard inequalities type for MT-convex stochastic process

Oualid Rholam, Barmaki Mohammed, Driss Gretete

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-1842

In this paper: This paper aims to establish novel Hermite-Hadamard-type inequalities for stochastic processes that exhibit MT-convexity. We extend our investigation to processes whose derivatives possess absolute MT...

AbstractReferencesFull Text PDF (265 KB)Views: 139Downloads: 66Citations: 0
Open Access Research Article·pp. 701–713·Vol. 28, Issue 3Apr 2025

A linear portrayal of the Galois group G by the ring of irreducible characters of the hyperoctahedral group

Pemha Binyam Gabriel Cedric

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-1858

In this paper: The purpose of this paper is to first present the hyperoctahedral group, Bn, as the wreath product of ℤ2 associated with Sn, the symmetric group and then from the ring, A, generated by the irreducible...

AbstractReferencesFull Text PDF (365 KB)Views: 127Downloads: 60Citations: 0
Open Access Research Article·pp. 715–732·Vol. 28, Issue 3Apr 2025

Inside adversary combinatorial attacks in secret sharing scheme via linear system of equations when n = 5

L. Sreenivasulu Reddy, Indrajeet Kumar

Published Online: 18 Dec 2024DOI: 10.47974/JDMSC-1866

In this paper: When an insider possesses greater than or equal to the threshold number of secret shares, he can retrieve an entire secret without any difficulty. This kind of task doesn’t have any big problems. In t...

AbstractReferencesFull Text PDF (475 KB)Views: 229Downloads: 93Citations: 0
Open Access Research Article·pp. 733–751·Vol. 28, Issue 3Apr 2025

Neuronal crypto system based on chaotic super-increasing sequence

Assia Merzoug, Hana Ali-Pacha, Adda Ali-Pacha, Özen Özer

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-1867

In this paper: Neural networks were originally developed as an alternative to artificial intelligence to solve problems such as control, shape or word recognition, decision-making, memory, and more. In this work, we...

AbstractReferencesFull Text PDF (847 KB)Views: 163Downloads: 82Citations: 0
Open Access Research Article·pp. 753–764·Vol. 28, Issue 3Apr 2025

A novel security algorithm for text and image data using multi node cryptographic algorithm

Amar Kumar Mohapatra, Pankaj Lathar, Shailendra Singh Gaur

Published Online: 20 Feb 2025DOI: 10.47974/JDMSC-1946

In this paper: In today’s world of Ubiquitous Computing, Network security plays an important role in preventing and reducing the chances of various network attacks and working on the various cryptographic algorithms...

AbstractReferencesFull Text PDF (949 KB)Views: 175Downloads: 68Citations: 0
Open Access Research Article·pp. 765–781·Vol. 28, Issue 3Apr 2025

Double Roman domination number of the zero-divisor graphs of commutative rings

Ravindra Kumar, Ashutosh Singh, Om Prakash

Published Online: 20 Feb 2025DOI: 10.47974/JDMSC-1966

In this paper: In 2016, Beeler et al. [9] introduced the concept of the double Roman dominating function and the double Roman domination number(DRDN) of a graph. Following the same concept, we extend the study and c...

AbstractReferencesFull Text PDF (497 KB)Views: 349Downloads: 65Citations: 0
Open Access Research Article·pp. 783–795·Vol. 28, Issue 3Apr 2025

Extremal unicyclic graphs with fixed leaves via Sombor index

Saira Javed, Aqsa Sattar, Muhammad Javaid

Published Online: 18 Dec 2024DOI: 10.47974/JDMSC-1988

In this paper: Gutman presented the Sombor index in 2021 as a topological molecular descriptor defined by graph A =  Sa1a2 ∈ E(A)√β(a1)2 + β(a1)2,  where β(a1) is the degree of the vertex a1 ∈ A. A connected graph i...

AbstractReferencesFull Text PDF (256 KB)Views: 229Downloads: 80Citations: 1
Open Access Research Article·pp. 797–807·Vol. 28, Issue 3Apr 2025

Minimum cycle basis of the α–product of Pm with Pn

Maref Y. M. Alzoubi, Talal Ali Al-Hawary

Published Online: 18 Dec 2024DOI: 10.47974/JDMSC-2000

In this paper: For a graph, its cycle space has a lot of bases, out of which we are interested in finding a basis of minimum length. A cycle basis length is the sum of all cycles lengths. In this work, we give cycle...

AbstractReferencesFull Text PDF (290 KB)Views: 130Downloads: 70Citations: 0
Open Access Research Article·pp. 809–825·Vol. 28, Issue 3Apr 2025

An approach of encryption that combines ECC and the adjacency matrices of graphs using extended generalized Lucas matrix as key matrix

Vaishali Billore, Naresh Patel, Hemant Makwana

Published Online: 26 Feb 2025DOI: 10.47974/JDMSC-2045

In this paper: These days, the best way to secure our data and conversations is to use message encryption techniques. Thanks to the proliferation of network and internet communications, advancements in message encry...

AbstractReferencesFull Text PDF (774 KB)Views: 165Downloads: 74Citations: 0
Open Access Research Article·pp. 827–847·Vol. 28, Issue 3Apr 2025

An investigation of k-ideals in (3, n)-semirings with (3, n)-ring congruences

P. Palakawong Na Ayutthaya, Bundit Pibaljommee

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2117

In this paper: Universal algebra commonly holds that if a congruence τ is imposed on an algebra A, the quotient algebra A/τ retains the structure of the such kind of the algebra A. In this paper, we provide a congru...

AbstractReferencesFull Text PDF (424 KB)Views: 142Downloads: 72Citations: 0
Open Access Research Article·pp. 849–867·Vol. 28, Issue 3Apr 2025

A stateless blockchain-based public key infrastructure

Amalan Joseph Antony, Kunwar Singh

Published Online: 26 Feb 2025DOI: 10.47974/JDMSC-2136

In this paper: Various designs exist for a Public Key Infrastructure (PKI), each with its own inherent security and optimization issues. Certain properties of the Bitcoin blockchain and its derivatives - mainly the...

AbstractReferencesFull Text PDF (217 KB)Views: 200Downloads: 86Citations: 0
Open Access Research Article·pp. 869–881·Vol. 28, Issue 3Apr 2025

On rainbow vertex anti-magic coloring of amalgamation graphs

Ridho Alfarisi, Arika Indah Kristiana, Dafik, Qurotul A’yun, M. Venkatachalam

Published Online: 14 Apr 2025DOI: 10.47974/JDMSC-2137

In this paper: A rainbow vertex anti-magic coloring represents a relatively new area of exploration in graph theory. This concept extends the idea of rainbow vertex coloring by incorporating elements of anti-magic l...

AbstractReferencesFull Text PDF (880 KB)Views: 324Downloads: 73Citations: 0
Open Access Research Article·pp. 883–890·Vol. 28, Issue 3Apr 2025

On the local (a, d)-edge antimagic coloring of gear graph and its subdivision

Arika Indah Kristiana, Ulziah Maghfirah, Ridho Alfarisi, Eko Waluyo, N. Mohanapriya, Dafik, R. M. Prihandini

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2139

In this paper: For any graph G = (V, E), with |V(G)| = p and |E(G)|= q. A bijection f : E(G) → {1, 2, 3,...,|E(G)|} is called an local (a,d)-edge antimagic coloring of G if the element of the edge-weight set w(uv) =...

AbstractReferencesFull Text PDF (340 KB)Views: 282Downloads: 65Citations: 0
Open Access Research Article·pp. 891–905·Vol. 28, Issue 3Apr 2025

On LCP and checkable group codes over finite non-commutative Frobenius rings

Sanjit Bhowmick, Javier de la Cruz, Edgar Martı­nez-Moro, Anuradha Sharma

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2187

In this paper: We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact fo...

AbstractReferencesFull Text PDF (330 KB)Views: 274Downloads: 95Citations: 0
Open Access Research Article·pp. 907–930·Vol. 28, Issue 3Apr 2025

Some classes of permutation polynomials of the form x(xs1(q+1) + bxs2(q+1)+a) over Fq2

Shalini Gupta, Manpreet Singh, Sagar Vinayak

Published Online: 12 Apr 2025DOI: 10.47974/JDMSC-2192

In this paper: Permutation polynomials hold significant relevance in the practical applications of finite fields. Presently, they constitute a pivotal focus in contemporary research endeavors. This paper undertakes...

AbstractReferencesFull Text PDF (418 KB)Views: 337Downloads: 74Citations: 0
Open Access Research Article·pp. 931–944·Vol. 28, Issue 3Apr 2025

Graph-based recommendation algorithm for personalized suggestions

Rashmi Singh, Khursheed Alam, Neha Bhardwaj

Published Online: 18 Apr 2025DOI: 10.47974/JDMSC-2204

In this paper: In the present study, we put forward a graph-based recommendation algorithm designed to provide personalized suggestions to users. By leveraging principles from graph theory, our algorithm utilizes th...

AbstractReferencesFull Text PDF (892 KB)Views: 213Downloads: 72Citations: 1
Open Access Research Article·pp. 945–958·Vol. 28, Issue 3Apr 2025

Cryptographic approach on edge regular power fuzzy graph

T. Bharathi, S. Shiny Paulin, S. Leo

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2216

In this paper: In this paper, we newly define the notion of edge regular power fuzzy graph, based on the properties of edge regular fuzzy graph and power fuzzy graph (PFG). Totally edge regular power fuzzy graph is...

AbstractReferencesFull Text PDF (742 KB)Views: 163Downloads: 57Citations: 0
Open Access Research Article·pp. 959–972·Vol. 28, Issue 3Apr 2025

An exploratory analysis of the evolution and trends of code-based cryptography

Ritu Redhu, Ekta Narwal

Published Online: 18 Apr 2025DOI: 10.47974/JDMSC-2236

In this paper: Code-based cryptography has emerged as a promising paradigm in cryptographic research, offering robust security foundations against quantum computing threats. This bibliometric analysis provides a com...

AbstractReferencesFull Text PDF (510 KB)Views: 159Downloads: 69Citations: 0
Open Access Research Article·pp. 973–979·Vol. 28, Issue 3Apr 2025

Design of public key cryptosystem based on the underlying mathematical complexity

Pauly J., Saju M I, Renjith Varghese, Antony John E F

Published Online: 11 Apr 2025DOI: 10.47974/JDMSC-2239

In this paper: This study aims to present a new cryptographic system based on the principles of the Discrete Logarithm Problem (DLP) applied to automorphisms and the non-commutative nature of rectangular matrices. T...

AbstractReferencesFull Text PDF (342 KB)Views: 140Downloads: 72Citations: 0
Open Access Research Article·pp. 981–990·Vol. 28, Issue 3Apr 2025

A novel approach for Menezes-Vanstone elliptic curve cryptosystem

Pankaj Kakati, Nayan Jyoti Bordoloi

Published Online: 18 Apr 2025DOI: 10.47974/JDMSC-2257

In this paper: Cryptographic algorithms are widely used to safeguard data and information over the internet. One of the most efficient technique used for this purpose is the Elliptic Curve Cryptosystem (ECC) which r...

AbstractReferencesFull Text PDF (314 KB)Views: 183Downloads: 71Citations: 0
Open Access Research Article·pp. 991–1005·Vol. 28, Issue 3Apr 2025

Finite discrete RGCN model for kinship verification

Vijay Prakash Sharma, Sunil Kumar

Published Online: 18 Apr 2025DOI: 10.47974/JDMSC-2295

In this paper: Kinship verification has been a challenging problem for generations, technology has been trying to resolve the same last two decades, without any success. It determines the blood relation between two...

AbstractReferencesFull Text PDF (573 KB)Views: 182Downloads: 77Citations: 0