Mehmet Özen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mehmet Özen has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Ünsal Tekir
Department of Mathematics, Marmara University, Istanbul, Türkiye
8 shared publications - Osama A. Naji
Department of Mathematics, Sakarya University, Sakarya, Turkey
4 shared publications - OsamaA. Naji
Department of Mathematics, Sakarya University, Sakarya, Turkey
4 shared publications - Suat Koç
Department of Mathematics, Marmara University, Istanbul, Turkey
4 shared publications - Vedat Şiap
Yildiz Tech Univ, Dept Engn Math, Istanbul, Turkey
3 shared publications - Eda Yıldız
Department of Mathematics, Yildiz Technical University, Istanbul, Turkey
2 shared publications
Latest Publications
- 23 October 2026
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (11) , 267
Codes over $\mathbb{F}_2[u,v]/\langle u^4 - 1, v^2 - v \rangle$ and their application to DNA codes- 23 October 2026
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (11) , 267
Codes over $\mathbb{F}_2[u,v]/\langle u^4 - 1, v^2 - v \rangle$ and their application to DNA codes- 19 June 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Classical S-primary submodules and their applications
This paper introduces the concept of classical [ ]-primary submodules, a generalization of [ ]-primary submodules where [ ] is a given multiplicatively closed subset. It provides various examples, characterizations, and relationships with classical primary submodules. Additionally, it investigates the conditions under which a submodule qualifies as classical [ ]-primary. The paper proves the existence of classical [ ]-primary decomposition in [ ]-Noetherian modules, that is, every proper submodule [ ] of an [ ]-Noetherian [ ]-module [ ] with [ ] can be expressed as a finite intersection of classical [ ]-primary submodules. Finally, the behavior of the concept has been examined under homomorphisms, in factor modules, Cartesian products of modules, and amalgamated duplication of modules.
- 19 June 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Classical S-primary submodules and their applications
This paper introduces the concept of classical [ ]-primary submodules, a generalization of [ ]-primary submodules where [ ] is a given multiplicatively closed subset. It provides various examples, characterizations, and relationships with classical primary submodules. Additionally, it investigates the conditions under which a submodule qualifies as classical [ ]-primary. The paper proves the existence of classical [ ]-primary decomposition in [ ]-Noetherian modules, that is, every proper submodule [ ] of an [ ]-Noetherian [ ]-module [ ] with [ ] can be expressed as a finite intersection of classical [ ]-primary submodules. Finally, the behavior of the concept has been examined under homomorphisms, in factor modules, Cartesian products of modules, and amalgamated duplication of modules.
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Submodules Satisfying the Uniformly Classical S ‐Primary Property
We define uniformly classical S ‐primary submodules, where S is a multiplicatively closed subset. A submodule W of an H ‐module E with ( W : H E )∩ S = ∅ is said to be a uniformly classical S ‐primary submodule if ∃ s ∈ S and such that whenever η γ ν ∈ W for η , γ ∈ H , ν ∈ E , then s η ν ∈ W or ( s γ ) k ν ∈ W . We investigate many properties of this new type of submodules and give relations with the other submodules. We provide various characterizations of this class of submodules in terms of other submodules and ideals. Moreover, we study the notion under homomorphisms, in factor modules, Cartesian product, localization, idealization, and amalgamation modules along an ideal with respect to a homomorphism.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Open AccessSubmodules Satisfying the Uniformly Classical S ‐Primary Property
We define uniformly classical S ‐primary submodules, where S is a multiplicatively closed subset. A submodule W of an H ‐module E with ( W : H E )∩ S = ∅ is said to be a uniformly classical S ‐primary submodule if ∃ s ∈ S and such that whenever η γ ν ∈ W for η , γ ∈ H , ν ∈ E , then s η ν ∈ W or ( s γ ) k ν ∈ W . We investigate many properties of this new type of submodules and give relations with the other submodules. We provide various characterizations of this class of submodules in terms of other submodules and ideals. Moreover, we study the notion under homomorphisms, in factor modules, Cartesian product, localization, idealization, and amalgamation modules along an ideal with respect to a homomorphism.
- Open Access
- 5 April 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (5) , 1-12
CRT representation of LWE Based TFHE
Homomorphic encryption is a special type of encryption that allows you to perform homomorphic operations on encrypted data without decryption, ensuring data security. This is the most important system that needs to be developed for customer and/or patient privacy on behalf of all sectors using a cloud system. In addition, with the increase in the use of IoT systems, one of the biggest problems in these areas is data protection and privacy. Although homomorphic encryption is solution to these problems, using homomorphic encryption schemes is quite costly and slow. Therefore, studies aimed at developing and improving homomorphic schemes are of great importance. But the creation of encryption schemes has remained theoretical due to the cost and computational size of these schemes. For this reason, many studies are being carried out in order to speed up encryption schemes and reduce costs. In this article, we plan to contribute to homomorphic encryption by applying the Chinese remainder theorem (CRT) to the torus fully homomorphic encryption (TFHE) scheme, which has recently achieved a major breakthrough. CRT is used to apply residue number system (RNS) which accelerates schemes to the TFHE scheme. By applying CRT to the scheme, we have achieved an acceleration of about 30% in the encryption and decryption times of the scheme.
- 5 April 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (5) , 1-12
Open AccessCRT representation of LWE Based TFHE
Homomorphic encryption is a special type of encryption that allows you to perform homomorphic operations on encrypted data without decryption, ensuring data security. This is the most important system that needs to be developed for customer and/or patient privacy on behalf of all sectors using a cloud system. In addition, with the increase in the use of IoT systems, one of the biggest problems in these areas is data protection and privacy. Although homomorphic encryption is solution to these problems, using homomorphic encryption schemes is quite costly and slow. Therefore, studies aimed at developing and improving homomorphic schemes are of great importance. But the creation of encryption schemes has remained theoretical due to the cost and computational size of these schemes. For this reason, many studies are being carried out in order to speed up encryption schemes and reduce costs. In this article, we plan to contribute to homomorphic encryption by applying the Chinese remainder theorem (CRT) to the torus fully homomorphic encryption (TFHE) scheme, which has recently achieved a major breakthrough. CRT is used to apply residue number system (RNS) which accelerates schemes to the TFHE scheme. By applying CRT to the scheme, we have achieved an acceleration of about 30% in the encryption and decryption times of the scheme.
- Open Access
- 1 January 2025
- Published by Kare Publishing in Sigma Journal of Engineering and Natural Sciences
- Vol. 43 (3) , 955-961
Applications of 4x4 involutive MDS matrix on finite fields F24, F26, F27
In today’s digital environment, a major amount of information is exchanged over insecure communication channels. In such an environment, cryptology plays a crucial role in ensuring that data is transmitted accurately and secure. Maximum distance separable (MDS) matrices which are derived from MDS codes, enhance the strength of cryptographic systems and contribute significantly to durability against different types of attacks. MDS matrices are widely used in the diffusion layers of lightweight block ciphers due to their easy usage and security. In addition, involutive MDS matrices with a minimum XOR number have lower costs and less memory because they allow the same matrix in encryption and decryption. For this reason, MDS matrices have been an area of interest. In this study, it is aimed to obtain 4x4 involutive MDS matrices on F24, F26 and F27 finite fields that have not been studied before. After that, we have determined the matrices that have minimum XOR numbers. Thus, we have obtained 4x4 involutive MDS matrices with good properties to be used in block ciphers.
- 1 January 2025
- Published by Kare Publishing in Sigma Journal of Engineering and Natural Sciences
- Vol. 43 (3) , 955-961
Open AccessApplications of 4x4 involutive MDS matrix on finite fields F24, F26, F27
In today’s digital environment, a major amount of information is exchanged over insecure communication channels. In such an environment, cryptology plays a crucial role in ensuring that data is transmitted accurately and secure. Maximum distance separable (MDS) matrices which are derived from MDS codes, enhance the strength of cryptographic systems and contribute significantly to durability against different types of attacks. MDS matrices are widely used in the diffusion layers of lightweight block ciphers due to their easy usage and security. In addition, involutive MDS matrices with a minimum XOR number have lower costs and less memory because they allow the same matrix in encryption and decryption. For this reason, MDS matrices have been an area of interest. In this study, it is aimed to obtain 4x4 involutive MDS matrices on F24, F26 and F27 finite fields that have not been studied before. After that, we have determined the matrices that have minimum XOR numbers. Thus, we have obtained 4x4 involutive MDS matrices with good properties to be used in block ciphers.
- 11 November 2024
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 119 (1) , 1-10
On regular fusible modules
- 11 November 2024
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 119 (1) , 1-10
On regular fusible modules
- Open Access
- 30 September 2024
- Published by Valahia University of Targoviste - Journal of Science and Arts in Journal of Science and Arts
- Vol. 24 (3) , 591-602
ANALYSIS OF A NON-LINEAR RECURRENCE FORMULATED USING MATRIX PERMANENTS
In this study, we focus on reanalyzing and reducing a recursive formula that generates the permanents of a family of matrices called k-tridiagonal Toeplitz. This recursive formula is dependent on two free variables and is in non-linear form. We first propose an alternative proof to the one given in “Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices”. This alternative proof is derived from a detailed examination of the designs of the submatrix blocks resulting from the expansion of permanents. Subsequently, we reduce this recursive formula to a linear form. This linear recursive formula simplifies the computation process by effectively reducing k-tridiagonal Toeplitz matrix permanents to those with a bandwidth of 1.
- 30 September 2024
- Published by Valahia University of Targoviste - Journal of Science and Arts in Journal of Science and Arts
- Vol. 24 (3) , 591-602
Open AccessANALYSIS OF A NON-LINEAR RECURRENCE FORMULATED USING MATRIX PERMANENTS
In this study, we focus on reanalyzing and reducing a recursive formula that generates the permanents of a family of matrices called k-tridiagonal Toeplitz. This recursive formula is dependent on two free variables and is in non-linear form. We first propose an alternative proof to the one given in “Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices”. This alternative proof is derived from a detailed examination of the designs of the submatrix blocks resulting from the expansion of permanents. Subsequently, we reduce this recursive formula to a linear form. This linear recursive formula simplifies the computation process by effectively reducing k-tridiagonal Toeplitz matrix permanents to those with a bandwidth of 1.
- Open Access
On Regular Fusible Modules
In this article, we introduce the notion of regular fusible modules. Let $R$ be a ring with an identity and $M$ an $R$-module. An element $0\neq m\in M$ is said to be regular fusible if there exists $r\in R$, a non zero-divisor of $M$, such that $mr$ can be written as the sum of a torsion element and a torsion free element in $M$. $M$ is called regular fusible if every nonzero element of $M$ is regular fusible. We characterize regular fusible modules in terms of fusible modules. In addition, we show that a regular fusible module over a right duo ring is reduced and nonsingular. Moreover, we study the regular fusible property under Cartesian product, trivial extension ring, and module of a fractions. Also, we characterize division rings in terms of fusible modules.Open AccessOn Regular Fusible Modules
In this article, we introduce the notion of regular fusible modules. Let $R$ be a ring with an identity and $M$ an $R$-module. An element $0\neq m\in M$ is said to be regular fusible if there exists $r\in R$, a non zero-divisor of $M$, such that $mr$ can be written as the sum of a torsion element and a torsion free element in $M$. $M$ is called regular fusible if every nonzero element of $M$ is regular fusible. We characterize regular fusible modules in terms of fusible modules. In addition, we show that a regular fusible module over a right duo ring is reduced and nonsingular. Moreover, we study the regular fusible property under Cartesian product, trivial extension ring, and module of a fractions. Also, we characterize division rings in terms of fusible modules. - Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (10) , 27908-27929
$ (\theta_i, \lambda) $-constacyclic codes and DNA codes over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $In this paper, three new automorphisms were identified over the ring $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $ where $ u^3 = u^2 $. With the help of these automorphisms, the characteristic structures of the generator polynomials for the $ \theta_i $-cyclic codes and $ (\theta_i, \lambda) $-constacyclic codes of odd length on this ring were investigated. Also, for all the units over the ring, $ \mathbb{Z}_{4} $-images of $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacyclic codes were reviewed with the associated codes based on determined transformations. Using these observations, new and optimal codes were obtained and presented in the table. In addition, a new transformation was identified that involved DNA base pairs with the elements of $ \mathbb{Z}_{4} $. Moreover, a unit reverse polynomial was created, and in this way a new generation method has been built to construct reversible DNA codes over this ring. Finally, this article was further enhanced with supporting examples of the DNA as a part of the study.- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (10) , 27908-27929
Open Access$ (\theta_i, \lambda) $-constacyclic codes and DNA codes over $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $In this paper, three new automorphisms were identified over the ring $ \mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4} $ where $ u^3 = u^2 $. With the help of these automorphisms, the characteristic structures of the generator polynomials for the $ \theta_i $-cyclic codes and $ (\theta_i, \lambda) $-constacyclic codes of odd length on this ring were investigated. Also, for all the units over the ring, $ \mathbb{Z}_{4} $-images of $ \theta_i $-cyclic and $ (\theta_i, \lambda) $-constacyclic codes were reviewed with the associated codes based on determined transformations. Using these observations, new and optimal codes were obtained and presented in the table. In addition, a new transformation was identified that involved DNA base pairs with the elements of $ \mathbb{Z}_{4} $. Moreover, a unit reverse polynomial was created, and in this way a new generation method has been built to construct reversible DNA codes over this ring. Finally, this article was further enhanced with supporting examples of the DNA as a part of the study. - 1 January 2023
- Published by University of Debrecen/ Debreceni Egyetem in Publicationes Mathematicae Debrecen
- Vol. 102 (1-2) , 81-93
On uniformly $1$-absorbing primary ideals
- 1 January 2023
- Published by University of Debrecen/ Debreceni Egyetem in Publicationes Mathematicae Debrecen
- Vol. 102 (1-2) , 81-93
On uniformly $1$-absorbing primary ideals