Results 11 to 20 of about 165,995,511 (248)
SOME PROPERTIES OF THE ZERO-DIVISOR GRAPH FOR THE RING OF GAUSSIAN INTEGERS MODULO n [PDF]
Glasgow Mathematical Journal, 2011 AbstractThis paper is a continuation for the study of the zero-divisor graph for the ring of Gaussian integers modulo n, Γ(ℤn[i]) in [8] (Emad Abu Osba, Salah Al-Addasi and Nafez Abu Jaradeh. Zero divisor graph for the ring of Gaussin integers modulo n. Comm. Algebra 36(10) (2008), 3865–3877). It is investigated, when is Γ(ℤn[i]) locally H, Hamiltonian
Osba, Emad Abu +2 more
openaire +3 more sources
Some properties of the extended zero-divisor graph of the ring of Gaussian integers modulo n [PDF]
Rad Hrvatske akademije znanosti i umjetnosti. Matematičke znanosti, 2020 Recently, Bennis and others studied an extension of the zero-divisor graph of a commutative ring R. They called this extension the extended zero-divisor graph of R, denoted by Γ(R). The graph Γ(R) has as set of vertices all the nonzero zero-divisors of R, Z(R)*, and two distinct vertices x and y are adjacent if there are nonnegative integers n and m ...
Basem Alkhamaiseh, Alkhamaiseh, Basem
openaire +3 more sources
Computing an arithmetic constant related to the ring of Gaussian integers [PDF]
Mathematics of Computation, 1985 We compute the analogue for Z [
Gramain, F., Weber, M.
openaire +2 more sources
Montgomery Reduction for Gaussian Integers [PDF]
, 2021 Modular arithmetic over integers is required for many cryptography systems. Montgomeryreduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Mont-gomery reduction is used for rings of ordinary integers.
Freudenberger, Jürgen +3 more
core +1 more source
Constructions of Dense Lattices of Full Diversity
Trends in Computational and Applied Mathematics, 2020 A lattice construction using Z-submodules of rings of integers of number fields is presented. The construction yields rotated versions of the laminated lattices A_n for n = 2,3,4,5,6, which are the densest lattices in their respective dimensions.
A. A. Andrade +3 more
doaj +1 more source
Memory‐constrained implementation of lattice‐based encryption scheme on standard Java Card platform
IET Information Security, 2021 The lattice‐based encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards.
Ye Yuan +4 more
doaj +1 more source
SPN based RGB image encryption over Gaussian integers [PDF]
HeliyonBander Almutairi +2 more
exaly +2 more sources
Integral cohomology and chern classes of the special linear group over the ring of integers [PDF]
, 2001 This paper is devoted to the complete calculation of the additive structure of the 2-torsion of the integral cohomology of the innite special linear group SL(Z) over the ring of integers Z.
Arlettaz, Dominique +3 more
core +1 more source
Public Key Cryptography over the Gaussian and Eisenstein Integers [PDF]
, 2023 Public key encryption has been studied in great detail mainly in the context of the ring of integers. In this thesis, we develop analogues of popular encryption schemes in the settings of Gaussian and Eisenstein integers.
Fazekas, Stefanie
core +4 more sources
Factor rings of the Gaussian integers
Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie, 2004 Whereas the homomorphic images of Z (the ring of integers) are well known, namely Z, {0} and Zn (the ring of integers modulo n), the same is not true for the homomorphic im-ages of Z[i] (the ring of Gaussian integers). More generally, let m be any nonzero square free integer (positive or negative), and consider the integral domain Z[ √m]={a + b √m | a,
Cody Patterson +2 more
openaire +2 more sources