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 …

For an elliptic curve EE over a finite field we define the point sequence (P_n)(P n)
recursively by P_n= ϑ (P_ n-1)= ϑ^ n (P_0) P n= ϑ (P n-1)= ϑ n (P 0) with an endomorphism …

For a given elliptic curve EE over a finite field of odd characteristic and a rational function f
on EE we first study the linear complexity profiles of the sequences f (nG), n= 1, 2,\dots n= 1 …

Secure pseudo-random number generators (PRNGs) have a lot of important applications in
cryptography. In this paper, we analyze a new PRNG related to the elliptic curve power …

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 …

Pseudorandom sequences, that is, sequences which are generated with deterministic
algorithms but look random, have many applications, for example in cryptography, in …