Pages that link to "Item:Q4015278"
From MaRDI portal
The following pages link to How to predict congruential generators (Q4015278):
Displaying 18 items.
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
- Quantum period reconstruction of approximate sequences (Q2379974) (← links)
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
- The Carlitz rank of permutations of finite fields: a survey (Q2437320) (← links)
- On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences (Q2442861) (← links)
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves (Q2572963) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← 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)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Quantum attacks on pseudorandom generators (Q4925033) (← links)
- Evaluation of splittable pseudo-random generators (Q5371945) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- Fixed points of the subset sum pseudorandom number generators (Q6101274) (← links)
- On elliptic curve $L$-functions integrated encryption scheme (Q6196946) (← links)