Certain Exponential Sums and Random Walks on Elliptic Curves Page 1 Canad. J. Math. Vol.
57 (2), 2005 pp. 338–350 Certain Exponential Sums and Random Walks on Elliptic Curves …

The two-prime generator of order 2 has several desirable randomness properties if the two
primes are chosen properly. In particular, Ding deduced exact formulas for the (periodic) …

We prove some bounds on incomplete additive character sums of polynomials over finite
fields. We also apply results on incomplete additive character sums to get a distribution …

In an earlier paper Hubert and the authors introduced and studied the notion of
pseudorandomness of binary lattices, and they also gave a construction for a binary lattice …

Generalizing earlier results, it is shown that if A, B, C, D are “large” subsets of a finite field F
q, then the equations a+ b= cd, resp. ab+ 1= cd can be solved with a ∈ A, b ∈ B, c ∈ C, d ∈ …

Polynomial Interpolation of the Discrete Logarithm Page 1 Designs, Codes and
Cryptography, 25, 63–72, 2002 C 2002 Kluwer Academic Publishers. Manufactured in The …

We study the relationship between two measures of pseudorandomness for families of
binary sequences: family complexity and cross-correlation measure introduced by Ahlswede …

We extend a result of Ding and Helleseth on the autocorrelation of a cyclotomic generator in
several ways. We define and analyze cyclotomic generators of arbitrary orders and over …

CONSTRUCTION OF PSEUDORANDOM BINARY LATTICES BASED ON MULTIPLICATIVE
CHARACTERS 1. Introduction Page 1 Periodica Mathematica Hungarica Vol. 59 (1), 2009, pp …

Recently, Shparlinski proved several results on the interpolation of the discrete logarithm in
finite prime fields by Boolean functions. In the first part of the paper, these results are …