Pages that link to "Item:Q3705347"
From MaRDI portal
The following pages link to Deciphering a linear congruential encryption (Q3705347):
Displaying 10 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)
- Inferring sequences produced by a linear congruential generator missing low-order bits (Q1121239) (← links)
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (Q1706614) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- Practical seed-recovery of fast cryptographic pseudo-random number generators (Q2096613) (← links)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)