23Tem
Can linear congruential generator be used in public-key cryptography?
The question is not about generating pseudo-random numbers with linear congruential generator.
A linear congruential generator (LCG) is defined by the recurrence relation:
[ X_{n+1} = (a X_n + c) \mod m ]
Can LCG be used in public-key cryptography (generating public key from private key, signing and verification), given that private key is four 64 bit integers $a$, $c$, $m$ and $n$, "generator point" seed $X_0$ is publicly known, and private key generated from cryptographically secure source of randomness?
