Compared to full feedback of the CSI in the SVD design in [1], the partial information, which between the RS and the MSs and is fed back to the BS, is a Gaussian integer matrix bounded by a modulo operation.

a square matrix with Gaussian integer entries, such that det(U) = [+ or -]1).

With VP, the transmit signal at the BS is formed by adding a (scaled) Gaussian integer perturbation p [member of] [[LAMBDA].

A Gaussian integer is any complex number of the form a + bi where a and b are integers.

In later secondary years students may also study prime numbers as part of enrichment and extension of the curriculum in the area of number theory, or as a component of school-based assessment, for example exploration of Gaussian integers as part of work on complex numbers in advanced mathematics.

A Gaussian integer is a complex number a + bi with both a and b in Z.

Such graphs are also useful in coding theory, and they were studied independently in [12] from a coding-theoretic point of view by using the language of Gaussian integers.

In our work we bigining with a study of the classical diffie-hellman key exchange that use the integer number, then we extend it using the domain of gaussian integer.

beta]][i] the group of units gaussian integer modula a gaussian prime [beta], with the multiplication binary operation.

After a fine introduction to basic notions, he covers unique factorization, the

Gaussian integers, and Pell's equation, and moves on to algebraic number theory.

So far, there have been many variants of RSA constructed in this manner: In 1985, Varadharajan and Odoni constructed an extension of RSA to matrix rings [15]; In 1993, Demytko, proposed an elliptic curve-based RSA variant at EUROCRYPT [16]; In 2004, El-Kassar, Hatary, and Awad developed a modified RSA in the domains of Gaussian integers and polynomials over finite fields [17].

4 The RSA on the quotient ring of Gaussian integers