Elliptic curves and their applications to cryptography: an introduction
Elliptic curves and their applications to cryptography: an introduction
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves
Designs, Codes and Cryptography
Multiplicative character sums and non linear geometric codes
EUROCODE '90 Proceedings of the International Symposium on Coding Theory and Applications
An Elliptic Curve Random Number Generator
Proceedings of the IFIP TC6/TC11 International Conference on Communications and Multimedia Security Issues of the New Century
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
Designs, Codes and Cryptography
On the Cyclicity of Elliptic Curves over Finite Field Extensions
Finite Fields and Their Applications
Cyclicity Statistics for Elliptic Curves over Finite Fields
Finite Fields and Their Applications
Sequences related to Legendre/Jacobi sequences
Information Sciences: an International Journal
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
Information Security and Cryptology
Remarks on Pseudorandom Binary Sequences Over Elliptic Curves
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
| Hi-index | 0.00 |
An upper bound is established for certain exponential sums with respect to multiplicative characters defined on the rational points of an elliptic curve over a prime field. The bound is applied to investigate the pseudo-randomness of a large family of binary sequences generated from elliptic curves by using discrete logarithm. That is, we use this estimate to show that the resulting sequences have the advantages of ‘small' well-distribution measure and ‘small' multiple correlation measure.