Fixed points of the subset sum pseudorandom number generators

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Analysis and design of stream ciphers
Rivest-Shamir-Adleman public key crytosystems do not always conceal messages
Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
On the fixed points of the map \(x \mapsto x^x\) modulo a prime
On the fixed points of the map \(x\mapsto x^x\) modulo a prime. II.
Efficient cryptographic schemes provably as secure as subset sum
Attacking the linear congruential generator on elliptic curves via lattice techniques
Dynamical systems of non-algebraic origin: Fixed points and orbit lengths
Distribution of Elements of Cosets of Small Subgroups and Applications
Pseudorandomness and Dynamics of Fermat Quotients
Reconstructing noisy polynomial evaluation in residue rings
Product Sets of Rationals, Multiplicative Translates of Subgroups in Residue Rings, and Fixed Points of the Discrete Logarithm
Attacking the Pollard Generator
How to predict congruential generators
Predicting nonlinear pseudorandom number generators
Interpolation of Fermat Quotients
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime and applications
On the number of solutions of exponential congruences
Cryptography and Coding
Some heuristics and results for small cycles of the discrete logarithm
Reconstructing points of superelliptic curves over a prime finite field