Pages that link to "Item:Q3820530"
From MaRDI portal
The following pages link to Inferring sequences produced by pseudo-random number generators (Q3820530):
Displaying 19 items.
- A generator of pseudo-random numbers sequences with a very long period (Q815410) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Cryptanalysis of a chaotic block cipher with external key and its improved version (Q929144) (← 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)
- Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator (Q1650812) (← 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)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Quantum period reconstruction of approximate sequences (Q2379974) (← 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)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- Exploring the randomness of mentally generated head–tail sequences (Q3386467) (← links)
- Comparative Analysis of Random Generators (Q3387110) (← links)
- Iteration entropy (Q4629386) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- On elliptic curve $L$-functions integrated encryption scheme (Q6196946) (← links)