Let p be a prime and let EE be an elliptic curve defined over the finite field F _p F p of p
elements. For a point G ∈ E (F _p) G∈ E (F p) the elliptic curve congruential generator (with …

Exponential sums over points of elliptic curves - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

Abstract Ahlswede, Khachatrian, Mauduit and Sárközy introduced the notion of family
complexity, Gyarmati, Mauduit and Sárközy introduced the cross-correlation measure for …

A family of elliptic curve pseudorandom binary sequences | SpringerLink Skip to main content
Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home …

In this paper, we examine the pseudorandomness of a family of sequences with respect to
two key measures: family complexity (f-complexity) and cross-correlation measure of order ℓ …

More constructions of pseudorandom sequences of k symbols - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

In an earlier paper, Hubert, Mauduit and Sárközy introduced and studied the notion of
pseudorandomness of binary lattices. Later constructions were given by using characters …

Gyarmati, Mauduit and Sárközy introduced the cross-correlation measure Φ _k (F) Φ k (F) to
measure the randomness of families of binary sequences F ⊂ {-1, 1\}^ NF⊂-1, 1 N. In this …

EN=(e1, e2,···, eN)∈ AN, where A={a1, a2,···, ak},(k∈ N, k≥ 2) is a finite set of k symbols.
Bérczi estimated the pseudorandom measures for a truly random sequence EN of k symbol …

For a given hyperelliptic curve C over a finite field with Jacobian JC, we consider the
hyperelliptic analogue of the congruential generator defined by W n= W n− 1+ D for n≥ 1 …