The following pages link to Cryptography and Coding (Q5428168):
Displaying 17 items.
- On the modular inversion hidden number problem (Q412197) (← links)
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← links)
- Finite binary sequences constructed by explicit inversive methods (Q938755) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← 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)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← 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 degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators (Q3584787) (← links)
- (Q4434884) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (Q5475716) (← links)
- On the Bit Security of Elliptic Curve Diffie–Hellman (Q5738794) (← links)
- Fixed points of the subset sum pseudorandom number generators (Q6101274) (← links)
- Inferring sequences produced by the quadratic generator (Q6134038) (← links)
