Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves

DOI10.1007/978-3-540-79499-8_19zbMath1166.11343OpenAlexW1579093566MaRDI QIDQ3600337

No author found.

Publication date: 10 February 2009

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79499-8_19

zbMATH Keywords

elliptic curvescharacter sumsdiscrepancypseudo-random sequenceslinear complexitydiscrete logarithm

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Elliptic curves over local fields (11G07)

Related Items (1)

Elliptic curve analogues of a pseudorandom generator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences, discrepancies and applications
• Cyclicity statistics for elliptic curves over finite fields
• On the Naor-Reingold pseudo-random function from elliptic curves
• On the cyclicity of elliptic curves over finite field extensions
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• On a family of pseudorandom binary sequences
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
• Elliptic Curves and Their Applications to Cryptography
• On the linear span of binary sequences obtained from q-ary m-sequences, q odd
• Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm
• Multiplicative character sums and Kummer coverings
• Certain Exponential Sums and Random Walks on Elliptic Curves
• A finite pseudorandom binary sequence
• Distribution of some sequences of points on elliptic curves
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.

This page was built for publication: Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves