In this paper we study the linear congruential generator on elliptic curves from the
cryptographic point of view. We show that if sufficiently many of the most significant bits of …

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 …

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 …

Let q≥ 2 be an integer and let sq (n) be the sum-of-digitsfunction of n in base q. The function
sq (n) has been studied in many directions and many properties have been obtained on the …

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 …

Mauduit, Rivat and Sárközy presented a construction of a binary sequence which utilizes
properties of additive characters and polynomials, and showed that for this sequence both …