Analysis of Pseudorandom Number Generator over Elliptic Curve

Abstract

Pseudorandom Number Generators (PRNGs) are computational algorithms that produce long sequence of random results, which are determined by a shorter initial seed or key. Elliptic curve cryptosystem is a public key cryptosystem. It is replacing with RSA in most of the cryptosystems because it has the same level of security with smaller key sizes. This system presents an extract of results taken from analyzing Nonlinear Filter Generator (NLFG) and Linear Congruential Generator (LCG) based on Elliptic Curves defined over prime fields. Randomness is a crucial resource for cryptography so outputs of these two algorithms are evaluated using statistical tests for randomness. This system will be implemented by using Visual C# programming language.