Remarks on Pseudorandom Binary Sequences Over Elliptic Curves

Authors:
László Mérai
Affiliations:
(Correspd.) (Research partially supported by Hungarian National Foundation for Scientific Research, Grant No. K67676 and by the Momentum fund of the Hungarian Academy of Sciences) Alfréd R ...
Venue:
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Year:
2012

Citing 6
Cited 0

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Elliptic Curve Pseudorandom Sequence Generators

SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Linear Congruential Generators Over Elliptic Curves

Linear Congruential Generators Over Elliptic Curves
On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves

Designs, Codes and Cryptography
Construction of pseudo-random binary sequences from elliptic curves by using discrete logarithm

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper the pseudorandomness of binary sequences defined over elliptic curves is studied and both the well-distribution and correlation measures are estimated. The paper is based on the Kohel-Shparlinski bound and the Erdös-Turán-Koksma inequality.