
Generator of PRN's on the norm group
Author(s) -
P. Fugelo,
S. Varbanets
Publication year - 2021
Publication title -
doslìdžennâ v matematicì ì mehanìcì
Language(s) - English
Resource type - Journals
ISSN - 2519-206X
DOI - 10.18524/2519-206x.2020.2(36).233737
Subject(s) - mathematics , modulo , combinatorics , pseudorandomness , quadratic residue , prime (order theory) , discrete mathematics , pseudorandom number generator , algorithm
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.