Prasanna Poojary
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Prasanna Poojary has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Vadiraja Bhatta G.. R.
Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, India
18 shared publications - Divya Acharya
Department of Mathematics Manipal Institute of Technology Bengaluru Manipal Academy of Higher Education Manipal India
5 shared publications - Suman Das
Department of Education, National Institute of Technology Calicut, Kozhikode, India
5 shared publications - Varsha Jarali
Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, India
5 shared publications - Badekara Sooryanarayana
Nitte University image/svg+xml
3 shared publications - Harikrishnan Panackal
Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, India
3 shared publications
Latest Publications
- Open Access
- 12 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 74709-74720
A Medical Image Encryption Algorithm Using Additive Closedness of Subsets in a Finite Additive Abelian Group and Joseph Queue
Data security is at the forefront of technical advancement in the modern era. This work suggests an r-value-based encryption technique for medical images. A non-negative quantity known as the r-value is used to identify the subsets of a finite additive group. The Joseph queue problem is used to permute a finite series of items. Joseph queues, and r-values were used to create a medical image encryption system. Through scrambling, the number of 0-valued intervals in Zn influenced the random distribution of pixels. Using images from several databases, the technique is examined using various kinds of tests. The statistical values fall within an acceptable range, as determined by the experimental study, and the suggested scheme is resistant to common attacks, including differential attacks, noise attacks, and special image attacks, among others. The performance of the proposed scheme is guaranteed by comparing it with the recently published scheme.
- 12 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 74709-74720
Open AccessA Medical Image Encryption Algorithm Using Additive Closedness of Subsets in a Finite Additive Abelian Group and Joseph Queue
Data security is at the forefront of technical advancement in the modern era. This work suggests an r-value-based encryption technique for medical images. A non-negative quantity known as the r-value is used to identify the subsets of a finite additive group. The Joseph queue problem is used to permute a finite series of items. Joseph queues, and r-values were used to create a medical image encryption system. Through scrambling, the number of 0-valued intervals in Zn influenced the random distribution of pixels. Using images from several databases, the technique is examined using various kinds of tests. The statistical values fall within an acceptable range, as determined by the experimental study, and the suggested scheme is resistant to common attacks, including differential attacks, noise attacks, and special image attacks, among others. The performance of the proposed scheme is guaranteed by comparing it with the recently published scheme.
- Open Access
- 6 January 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (4) , 937-941
Correction to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings
- 6 January 2026
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (4) , 937-941
Open AccessCorrection to: On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings
- Open Access
Reversible and Reversible-Complement Double Cyclic Codes over F4+vF4 and its Application to DNA Codes
In this article, we study the algebraic structure of double cyclic codes of length $(m, n)$ over $\mathbb{F}_4$ and we give a necessary and sufficient condition for a double cyclic code over $\mathbb{F}_4$ to be reversible. Also, we determine the algebraic structure of double cyclic codes of length $(m, n)$ over $\mathbb{F}_4+v\mathbb{F}_4$ with $v^2=v$, satisfying the reverse constraint and the reverse-complement constraint. Then we establish a one-to-one correspondence $ψ$ between the 16 DNA double pairs $S_{D_{16}} $ and the 16 elements of the finite ring $\mathbb{F}_4+v\mathbb{F}_4$. We also discuss the GC-content of DNA double cyclic codes.Open AccessReversible and Reversible-Complement Double Cyclic Codes over F4+vF4 and its Application to DNA Codes
In this article, we study the algebraic structure of double cyclic codes of length $(m, n)$ over $\mathbb{F}_4$ and we give a necessary and sufficient condition for a double cyclic code over $\mathbb{F}_4$ to be reversible. Also, we determine the algebraic structure of double cyclic codes of length $(m, n)$ over $\mathbb{F}_4+v\mathbb{F}_4$ with $v^2=v$, satisfying the reverse constraint and the reverse-complement constraint. Then we establish a one-to-one correspondence $ψ$ between the 16 DNA double pairs $S_{D_{16}} $ and the 16 elements of the finite ring $\mathbb{F}_4+v\mathbb{F}_4$. We also discuss the GC-content of DNA double cyclic codes. - Open AccessLee Distance of cyclic codes of length $2^ς$ over $\mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$Let $p$ be a prime number and $ς$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^ς$ over $\mathcal{R}$ are precisely the ideals of the local ring $\frac{\mathcal{R}[x]}{\langle x^{2^ς}-1 \rangle}$. The Gray map from a code of Lee weight over $\mathbb{Z}_4$ to a code with Hamming weight over $\mathbb{F}_2$ is known to preserve weight. In this paper, we determine the Lee distance of cyclic codes of length $2^ς$ over $\mathcal{R}$.Open AccessLee Distance of cyclic codes of length $2^ς$ over $\mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$Let $p$ be a prime number and $ς$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^ς$ over $\mathcal{R}$ are precisely the ideals of the local ring $\frac{\mathcal{R}[x]}{\langle x^{2^ς}-1 \rangle}$. The Gray map from a code of Lee weight over $\mathbb{Z}_4$ to a code with Hamming weight over $\mathbb{F}_2$ is known to preserve weight. In this paper, we determine the Lee distance of cyclic codes of length $2^ς$ over $\mathcal{R}$.
- 12 July 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (07)
On metric dimension of hs×p hellebores flower graph
A metric basis is a subset of vertex set in a graph [ ], such that every vertex in the graph [ ] has a unique distance vector to the vertices in the subset. The cardinality of the metric basis is called the metric dimension of [ ], and is presented by [ ]. In this paper, we define the hellebores flower graph, and it is denoted by [ ]. For this graph, we investigate its metric basis as well as the metric dimension, and we also show that it is unbounded and is equal to [ ] if [ ] and [ ] otherwise.
- 12 July 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 18 (07)
On metric dimension of hs×p hellebores flower graph
A metric basis is a subset of vertex set in a graph [ ], such that every vertex in the graph [ ] has a unique distance vector to the vertices in the subset. The cardinality of the metric basis is called the metric dimension of [ ], and is presented by [ ]. In this paper, we define the hellebores flower graph, and it is denoted by [ ]. For this graph, we investigate its metric basis as well as the metric dimension, and we also show that it is unbounded and is equal to [ ] if [ ] and [ ] otherwise.
- Open Access
Some more constructions of $n-$cycle permutation polynomials
$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In this article, we propose criteria for the construction of $ n-$cycle permutation using linearized polynomial $ L(x) $ for larger $ n $. Furthermore, we investigate and generalize certain novel forms of $ n-$cycle permutation polynomials. Finally, we demonstrate our approach by constructing explicit $ n-$cycle permutation of the form $ L(x)+γh(Tr_{q^{m}/q}(x)) $, and $ G(x)+γf(x) $ with a Boolean function $ f(x) $. The polynomial $ x^{d}+γf(x) $ with $ f(x) $ being a Boolean function is shown to be quadruple and quintuple permutation polynomials. Moreover, linear binomial triple-cycle permutation polynomials are constructed.Open AccessSome more constructions of $n-$cycle permutation polynomials
$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In this article, we propose criteria for the construction of $ n-$cycle permutation using linearized polynomial $ L(x) $ for larger $ n $. Furthermore, we investigate and generalize certain novel forms of $ n-$cycle permutation polynomials. Finally, we demonstrate our approach by constructing explicit $ n-$cycle permutation of the form $ L(x)+γh(Tr_{q^{m}/q}(x)) $, and $ G(x)+γf(x) $ with a Boolean function $ f(x) $. The polynomial $ x^{d}+γf(x) $ with $ f(x) $ being a Boolean function is shown to be quadruple and quintuple permutation polynomials. Moreover, linear binomial triple-cycle permutation polynomials are constructed. - Open Access
- 26 June 2025
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (4) , 921-935
On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings
The design of S-boxes, or substitution boxes, in block ciphers relies on measures such as the Difference Distribution Table (DDT) and differential uniformity to gauge the function’s resistance to differential cryptanalysis. S-boxes with low differential uniformity are strong candidates for S-box design due to their robust resistance to differential attacks, leading to the creation of historical families of Almost Perfect Nonlinear (APN) and Perfect Nonlinear (PN) functions with the lowest differential uniformity. Recently, the concept of c -DDT and c -differential uniformity has been introduced, opening the door to c -Almost Perfect Nonlinear (AP c N) and c -Perfect Nonlinear (P c N) functions, potentially expanding differential cryptanalysis. Functions with low c -differential uniformity, notably APcN and PcN, have gained significant attention, leading to new connections with other objects. In this paper, we explore new classes of perfect c -nonlinear and almost perfect c -nonlinear functions over finite fields of arbitrary characteristics. We extend the methods used in the AGW (Akbary, Ghioca, Wang) criterion and AGW-like criterion to design perfect c -nonlinear and almost perfect c -nonlinear functions over finite fields by considering linearized polynomials and linear structures.
- 26 June 2025
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (4) , 921-935
Open AccessOn generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings
The design of S-boxes, or substitution boxes, in block ciphers relies on measures such as the Difference Distribution Table (DDT) and differential uniformity to gauge the function’s resistance to differential cryptanalysis. S-boxes with low differential uniformity are strong candidates for S-box design due to their robust resistance to differential attacks, leading to the creation of historical families of Almost Perfect Nonlinear (APN) and Perfect Nonlinear (PN) functions with the lowest differential uniformity. Recently, the concept of c -DDT and c -differential uniformity has been introduced, opening the door to c -Almost Perfect Nonlinear (AP c N) and c -Perfect Nonlinear (P c N) functions, potentially expanding differential cryptanalysis. Functions with low c -differential uniformity, notably APcN and PcN, have gained significant attention, leading to new connections with other objects. In this paper, we explore new classes of perfect c -nonlinear and almost perfect c -nonlinear functions over finite fields of arbitrary characteristics. We extend the methods used in the AGW (Akbary, Ghioca, Wang) criterion and AGW-like criterion to design perfect c -nonlinear and almost perfect c -nonlinear functions over finite fields by considering linearized polynomials and linear structures.
- Open Access
Enumeration of subsets with closedness in finite fields of characteristic 2
The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of characteristic 2 and represent them as the spectrum of values. Based on these values the subsets can be further studied as partial Steiner triple systems, sum-free sets, Sidon sets, and Schure triples.
Open AccessEnumeration of subsets with closedness in finite fields of characteristic 2
The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of characteristic 2 and represent them as the spectrum of values. Based on these values the subsets can be further studied as partial Steiner triple systems, sum-free sets, Sidon sets, and Schure triples.
- Open Access
- 27 May 2025
- Published by Springer Nature in Discover Applied Sciences
- Vol. 7 (6) , 1-15
Applications of $\alpha$-level neutrosophic set and strong $\alpha$-level neutrosophic setIn this article, we present an innovative extension of the concept of $$\alpha$$ -level neutrosophic set (NS). Building upon the pioneering work of Johnson Awolola [14] in 2020, who initially defined $$\alpha$$ -level NS, our research introduces a new notion of $$\alpha$$ -level NS, aimed at enhancing the precision and practicality of outcomes. Within this context, we establish both the concept of an $$\alpha$$ -level NS and a robust variant termed the strong $$\alpha$$ -level NS. These novel concepts are then applied to the domain of neutrosophic graphs (NG), enabling the exploration of diverse properties and their implications.- 27 May 2025
- Published by Springer Nature in Discover Applied Sciences
- Vol. 7 (6) , 1-15
Open AccessApplications of $\alpha$-level neutrosophic set and strong $\alpha$-level neutrosophic setIn this article, we present an innovative extension of the concept of $$\alpha$$ -level neutrosophic set (NS). Building upon the pioneering work of Johnson Awolola [14] in 2020, who initially defined $$\alpha$$ -level NS, our research introduces a new notion of $$\alpha$$ -level NS, aimed at enhancing the precision and practicality of outcomes. Within this context, we establish both the concept of an $$\alpha$$ -level NS and a robust variant termed the strong $$\alpha$$ -level NS. These novel concepts are then applied to the domain of neutrosophic graphs (NG), enabling the exploration of diverse properties and their implications. - 17 May 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (05)
Repeated-root constacyclic codes of length 3ps over the finite non-chain ring ????pm[u,v] 〈u2,v2,uv−vu〉 and their duals
This study aims to determine the algebraic structures of [ ]-constacyclic codes of length [ ] over the finite commutative non-chain ring [ ], for a prime [ ] For the unit [ ], we consider two different instances: when [ ] is a cube in [ ] and when it is not. Analyzing the first scenario is relatively easy. When [ ] is not a unit in [ ], we consider several subcases and determine the algebraic structures of constacyclic codes in those cases. Further, we also provide the number of codewords and the duals of [ ]-constacyclic codes.
- 17 May 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (05)
Repeated-root constacyclic codes of length 3ps over the finite non-chain ring ????pm[u,v] 〈u2,v2,uv−vu〉 and their duals
This study aims to determine the algebraic structures of [ ]-constacyclic codes of length [ ] over the finite commutative non-chain ring [ ], for a prime [ ] For the unit [ ], we consider two different instances: when [ ] is a cube in [ ] and when it is not. Analyzing the first scenario is relatively easy. When [ ] is not a unit in [ ], we consider several subcases and determine the algebraic structures of constacyclic codes in those cases. Further, we also provide the number of codewords and the duals of [ ]-constacyclic codes.