Pages that link to "Item:Q1009176"
From MaRDI portal
The following pages link to Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176):
Displaying 13 items.
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes (Q2101189) (← links)
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods (Q2182710) (← links)
- Predicting the elliptic curve congruential generator (Q2363380) (← links)
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
- On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences (Q2442861) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods (Q2817871) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators (Q3584787) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- Fixed points of the subset sum pseudorandom number generators (Q6101274) (← links)
