In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm
for the efficient generation of a sequence of uniform pseudorandom vectors in high …

In the present paper, the distribution of pseudorandom vectors, derived from a specific set of
rational points on elliptic curves over finite fields, is studied by estimating its discrepancy …

Additive Combinatorics over Finite Fields: New Results and Applications. Page 245 Igor E.
Shparlinski Additive Combinatorics over Finite Fields: New Results and Applications Abstract …

We present attacks on a generalized subset-sum pseudorandom generator, which was
proposed by von zur Gathen and Shparlinski in 2004. Our attacks rely on a sub-quadratic …

Linear pseudo-random numbers generators are easy to understand and to implement. The
most famous of them is the Linear Congruential Generator. In the first part of this thesis we …

This paper studies the task of two-sources randomness extractors for elliptic curves defined
over finite fields $ K $, where $ K $ can be a prime or a binary field. In fact, we introduce new …

This paper studies the task of two-sources randomness extractors for elliptic curves defined
over finite fields K, where K can be a prime or a binary field. In fact, we introduce new …

This work is based on the proposal of a deterministic randomness extractor of a random
Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite …

We propose two-sources randomness extractors over finite fields and on elliptic curves that
can extract from two sources of information without consideration of other assumptions that …

We propose two-sources randomness extractors over finite fields and on elliptic curves that
can extract from two sources of information without consideration of other assumptions that …