Ring Of Gaussian Integers Research Articles

On Standard Forms of the Pairs of Matrices Over the Ring of Gaussian Integers with Respect to the (z,k)-Equivalence

On Standard Forms of the Pairs of Matrices Over the Ring of Gaussian Integers with Respect to the (z,k)-Equivalence

On Mignotte secret sharing schemes over Gaussian integers

Secret Sharing Schemes (SSS) are methods for distributing a secret among a set of participants. One of the first Secret Sharing Schemes was proposed by M. Mignotte, based on the Chinese remainder theorem over the ring of integers. In this article we extend the Mignotte's scheme to the ring of Gaussian Integers and study some of its properties. While doing this we aim to solve a gap in a previous construction of such extension. In addition we show that any access structure can be made through a SSS over Z[i].

The Wiener index of the zero-divisor graph of a finite commutative ring with unity

Let R be an arbitrary finite commutative ring with unity. The zero-divisor graph of R, denoted by Γ(R), is a graph with vertex set non-zero zero-divisors of R and two of them are connected by an edge if their product is zero. In this paper, we derive a formula for the Wiener index of the graph Γ(R). In the literature, the Wiener index of the graph Γ(R) is known only for R=Zn, the ring of integers modulo n. As applications of our formula, the Wiener index of Γ(R) is explicitly calculated when (i) R is a reduced ring, (ii) R is the ring of integers modulo n, and (iii) more generally R is the product of ring of integers modulo n. The Wiener index of the zero-divisor graph of the ring of Gaussian integers over Zn is also discussed.

О порождении групп SLn(Z+iZ) и P SLn(Z+iZ) тремя инволюциями, две их которых перестановочны

M. C. Tamburini and P. Zucca proved that the special linear group of dimension greater than 13 over the ring of Gaussian integers is generated by three involutions, two of which commute (J. of Algebra, 1997). A similar result for projective special linear groups of dimension greater than 6 was established by D. V. Levchuk and Ya. N. Nuzhin (J. Sib. Fed. Univ. Math. Phys., 2008, Bulletin of Novosibirsk State Univ., 2009). We consider the remaining small dimensions. It is proved that the projective special linear group of dimension other than 5 and 6 over the ring of Gaussian integers if and only if is generated by three involutions, two of which commute when its dimension is greater than 6. For dimension 5 and 6, it was possible to find only generators triples of involutions without the condition that two of which commute.

On standard forms of pairs of matrices over the ring of Gaussian integers with respect to (z,k)-equivalence

On standard forms of pairs of matrices over the ring of Gaussian integers with respect to (z,k)-equivalence

Enumeration of Involutions of Finite Rings

In this paper, we study a special class of elements in the finite commutative rings called involutions. An involution of a ring R is an element with the property that x^2-1=0 for some x in R. This study describes both the implementation and enumeration of the involutions of various rings, such as cyclic rings, non-cyclic rings, zero-rings, finite fields, and especially rings of Gaussian integers. The paper begins with simple well-known results of an equation x^2-1=0 over the finite commutative ring R. It provides a concrete setting to enumerate the involutions of the finite cyclic and non-cyclic rings R, along with the isomorphic relation I(R)≅Z_2^k.

Generator of PRN's on the norm group

Let $p$ be a prime number, $d\in\mathds{N}$, $\left(\frac{-d}{p}\right)=-1$, $m>2$, and let $E_m$ denotes the set of of residue classes modulo $p^m$ over the ring of Gaussian integers in imaginary quadratic field $\mathds{Q}(\sqrt{-d})$ with norms which are congruented with 1 modulo $p^m$. In present paper we establish the polynomial representations for real and imagimary parts of the powers of generating element $u+iv\sqrt{d}$ of the cyclic group $E_m$. These representations permit to deduce the ``rooted bounds'' for the exponential sum in Turan-Erd\"{o}s-Koksma inequality. The new family of the sequences of pseudo-random numbers that passes the serial test on pseudorandomness was being buit.

Montgomery Reduction for Gaussian Integers

Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers. In contrast, we investigate the modular reduction over rings of Gaussian integers. Gaussian integers are complex numbers where the real and imaginary parts are integers. Rings over Gaussian integers are isomorphic to ordinary integer rings. In this work, we show that Montgomery reduction can be applied to Gaussian integer rings. Two algorithms for the precision reduction are presented. We demonstrate that the proposed Montgomery reduction enables an efficient Gaussian integer arithmetic that is suitable for elliptic curve cryptography. In particular, we consider the elliptic curve point multiplication according to the randomized initial point method which is protected against side-channel attacks. The implementation of this protected point multiplication is significantly faster than comparable algorithms over ordinary prime fields.

The standard form of matrices over the ring of Gaussian integers with respect to (z,k)-equivalence

The standard form of matrices over the ring of Gaussian integers with respect to (z,k)-equivalence

On strong metric dimension of zero-divisor graphs of rings

In this paper, we study the strong metric dimension of zero-divisor graph $\Gamma(R)$ associated to a ring $R$. This is done by transforming the problem into a more well-known problem of finding the vertex cover number $\alpha(G)$ of a strong resolving graph $G_{sr}$. We find the strong metric dimension of zero-divisor graphs of the ring $\mathbb{Z}_n$ of integers modulo $n$ and the ring of Gaussian integers $\mathbb{Z}_n[i]$ modulo $n$. We obtain the bounds for strong metric dimension of zero-divisor graphs and we also discuss the strong metric dimension of the Cartesian product of graphs.

Lattices Over Algebraic Integers With an Application to Compute-and-Forward

In this paper, we extend Construction A of lattices to the ring of algebraic integers of a general imaginary quadratic field that may not form a principal ideal domain (PID). We show that such a construction can produce good lattices for coding in the sense of Poltyrev and for MSE quantization. As an application, we then apply the proposed lattices to the compute-and-forward paradigm with limited feedback. Without feedback, compute-and-forward is typically realized with lattice codes over the ring of integers, the ring of Gaussian integers, or the ring of Eisenstein integers, which are all PIDs. A novel scheme called adaptive compute-and-forward is proposed to exploit the limited feedback about the channel state by working with the best ring of imaginary quadratic integers. Simulation results show that by adaptively choosing the best ring among the considered ones according to the limited feedback, the proposed adaptive compute-and-forward provides a better performance than that provided by the conventional compute-and-forward scheme which works over Gaussian or Eisenstein integers solely.

Coprime Sensing via Chinese Remaindering Over Quadratic Fields—Part I: Array Designs

A coprime antenna array consists of two or more sparse subarrays featuring enhanced degrees of freedom (DOF) and reduced mutual coupling. This paper introduces a new class of planar coprime arrays, based on the theory of ideal lattices. In quadratic number fields, a splitting prime p can be decomposed into the product of two distinct prime ideals, which give rise to the two sparse subarrays. Their virtual difference coarray enjoys a quadratic gain in DOF, thanks to the generalized Chinese remainder theorem (CRT). To enlarge the contiguous aperture of the coarray, we present hole-free symmetric CRT arrays with simple closed-form expressions. The ring of Gaussian integers and the ring of Eisenstein integers are considered as examples to demonstrate the procedure of designing coprime arrays. With Eisenstein integers, our design yields a difference coarray that is a subset of the hexagonal lattice, offering a significant gain in DOF over the rectangular lattice, given the same physical areas. Maximization of CRT arrays in the aspect of essentialness and the superior performance in the context of angle estimation will be presented in the companion paper (Part II).

A model of discrete quantum computation

We present a model of discrete quantum computing focused on a set of discrete quantum states. For this, we choose the set that is the most outstanding in terms of simplicity of the states: the set of Gaussian coordinate states, which includes all the quantum states whose coordinates in the computation base, except for a normalization factor $$\sqrt{2^{-k}}$$ , belong to the ring of Gaussian integers $$\mathbb {Z}[i]=\{a+bi\ |\ a,b\in \mathbb {Z}\}$$ . We also introduce a finite set of quantum gates that transforms discrete states into discrete states and generates all discrete quantum states, and the set of discrete quantum gates, as the quantum gates that leave the set of discrete states invariant. We prove that the quantum gates of the model generate the expected discrete states and the discrete quantum gates of 2-qubits and conjecture that they also generate the discrete quantum gates of n-qubits.

Efficient Integer Coefficient Search for Compute-and-Forward

Integer coefficient selection is an important decoding step in the implementation of compute-and-forward (C-F) relaying scheme. Choosing the optimal integer coefficients in C-F has been shown to be a shortest vector problem (SVP) which is known to be NP hard in its general form. Exhaustive search of the integer coefficients is only feasible in complexity for small number of users while approximation algorithms such as Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm only find a vector within an exponential factor of the shortest vector. An optimal deterministic algorithm was proposed for C-F by Sahraei and Gastpar specifically for the real valued channel case. In this paper, we adapt their idea to the complex valued channel and propose an efficient search algorithm to find the optimal integer coefficient vectors over the ring of Gaussian integers and the ring of Eisenstein integers. A second algorithm is then proposed that generalises our search algorithm to the Integer-Forcing MIMO C-F receiver. Performance and efficiency of the proposed algorithms are evaluated through simulations and theoretical analysis.

Simultaneous p-orderings and minimizing volumes in number fields

In [VP], V.V. Volkov and F.V. Petrov consider the problem of existence of the so-called n-universal sets (related to simultaneous p-orderings of Bhargava) in the ring of Gaussian integers. A related problem concerning Newton sequences was considered by D. Adam and P.-J. Cahen in [AC]. We extend their results to arbitrary imaginary quadratic number fields and prove an existence theorem that provides a strong counterexample to a conjecture of Volkov–Petrov on minimal cardinality of n-universal sets. Along the way, we discover a link with Euler–Kronecker constants and prove a lower bound on Euler–Kronecker constants which is of the same order of magnitude as the one obtained by Ihara.

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs

Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv \pm 5 \pmod{12}$, the Cayley graph $\mathcal{G}_p=\textnormal{Cay}(\Z_p[i], S_2)$, where $S_2$ is the set of units of $\Z_p[i]$, induces a 2-quasi-perfect Lee code over $\Z_p^m$, where $m=2\lfloor \frac{p}{4}\rfloor$. They also conjectured that $\mathcal{G}_p$ is a Ramanujan graph for every prime $p$ such that $p\equiv 3 \pmod{4}$. In this paper, we solve this conjecture. Our main tools are Deligne's bound from 1977 for estimating a particular kind of trigonometric sum and a result of Lov\'{a}sz from 1975 (or of Babai from 1979) which gives the eigenvalues of Cayley graphs of finite Abelian groups. Our proof techniques may motivate more work in the interactions between spectral graph theory, character theory, and coding theory, and may provide new ideas towards the famous Golomb--Welch conjecture on the existence of perfect Lee codes.

A zero-knowledge identification protocol in the ring of Gaussian integers

In this paper, a zero-knowledge identification protocol is proposed by extending from the rational of natural integers ℤ, to the ring of Gaussian integers ℤ[i]. Its security relies on the integer factorization problem and extraction of square roots of a Gaussian integer over ℤn. Properties, space complexity and time complexity of the proposed protocol are also discussed.

ARITHMETIC FUNCTIONS ON GAUSSIAN INTEGERS

In this paper we present a short study of the ring of complex-valued arithmetic functions defined on the ring of Gaussian integers. We investigate an absolute value and the corresponding metric structure on this ring.

On the interpolation of integer-valued polynomials

It is well known that if polynomial with rational coefficients of degree n takes integer values in points 0 , 1 , … , n then it takes integer values in all integer points. Are there sets of n + 1 points with the same property in other integral domains? We show that answer is negative for the ring of Gaussian integers Z [ i ] when n is large enough, thus answering the question of Hensley (1977). Also we discuss the question about minimal possible size of a set, such that if polynomial takes integer values in all points of this set then it is integer-valued. For a video summary of this paper, please click here or visit http://youtu.be/hCE7M802oZ8 . Author Video Watch what authors say about their articles

The Tarry-Escott problem of degree two

The optimum reduced solutions of degree two of the Tarry-Escott problem over a ring of Gaussian integers and over a ring of polynomials over a finite field are completely determined.