It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, invented by the authors in a recent series of works, can be applied to estimating sums of multiplicative characters as well. As a consequence, results are obtained about the distribution of power residues and primitive elements in such sequences.7 page(s
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
AbstractWe obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequenc...
Abstract. We prove a new bound for multiplicative character sums of nonlinear recurring sequences wi...
AbstractWe prove a new bound on exponential sums for nonlinear recurring sequences. This result impr...
We prove some new bounds on exponential sums for nonlinear re-curring sequences over residue rings. ...
Abstract The main purpose of this paper is to study the distribution properties ofm-power residues n...
We estimate multiplicative character sums along the orbits of a class of nonlinear recurrence vector...
We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
We estimate multiplicative character sums over the integers with a fixed sum of binary digits and ap...
Abstract. Nonlinear congruential pseudorandom number generators can have unexpectedly short periods....
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds o...
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
AbstractWe obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequenc...
Abstract. We prove a new bound for multiplicative character sums of nonlinear recurring sequences wi...
AbstractWe prove a new bound on exponential sums for nonlinear recurring sequences. This result impr...
We prove some new bounds on exponential sums for nonlinear re-curring sequences over residue rings. ...
Abstract The main purpose of this paper is to study the distribution properties ofm-power residues n...
We estimate multiplicative character sums along the orbits of a class of nonlinear recurrence vector...
We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
We estimate multiplicative character sums over the integers with a fixed sum of binary digits and ap...
Abstract. Nonlinear congruential pseudorandom number generators can have unexpectedly short periods....
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds o...
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudor...
AbstractWe exploit a connection between decimations and products to deduce the generating polynomial...
AbstractWe obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequenc...