I recently started learning about encryption. I read about how elliptic curves can be used to create pseudo random numbers (and how the nsa might have abused this fact to create a backdoor in encryptions software).
So as I understand in an elliptic curve takes the form of $y^2=x^3-3x+b$. The algorithm provide by NIST in appendix A1 http://csrc.nist.gov/publications/nistpubs/800-90A/SP800-90A.pdf describes how a set of pseudo random number can be generated using a very big prime number.
In the context of learning more about pseudo random numbers I would like to create my own pseudo random number generator based on the algorithm. Preferable I would like to do this using a small primes number so I can also practice breaking encryption based on it.
Now the problem is I am not that great in Maths or programming yet... so sketch in the NIST document is a little vague in my eyes. Essentially I have not clue where to start build my program.