1. A simple unpredictable pseudo-random number generator;Blum;SIAM J. Comput.,1986
2. Easing coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness;Benhamouda,2016
3. Pseudorandom sequences from elliptic curves. Finite fields with applications to coding theory;Beelen,2002
4. Elliptic Curves in Cryptography;Blake,1999
5. Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods;Bauer,2012