Skip to Main content Skip to Navigation
Journal articles

Inferring sequences produced by elliptic curve generators using Coppersmith's methods

Abstract : We analyze the security of two number-theoretic pseudo-random generators based on elliptic curves: the elliptic curve linear congruential generator and the elliptic curve power generator. We show that these recursive generators are insecure if sufficiently many bits are output at each iteration (improving notably the prior cryptanalysis of Gutierrez and Ibeas from 2007). We present several theoretical attacks based on Coppersmith's techniques for finding small roots on polynomial equations. Our results confirm that these generators are not appropriate for cryptographic purposes.
Document type :
Journal articles
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02568170
Contributor : Damien Vergnaud <>
Submitted on : Friday, May 8, 2020 - 3:30:14 PM
Last modification on : Tuesday, March 23, 2021 - 9:28:03 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Thierry Mefenza, Damien Vergnaud. Inferring sequences produced by elliptic curve generators using Coppersmith's methods. Theoretical Computer Science, Elsevier, 2020, 830-831, pp.20-42. ⟨10.1016/j.tcs.2020.04.025⟩. ⟨hal-02568170⟩

Share

Metrics

Record views

80

Files downloads

118