A random number generator based on elliptic curve operations

Abstract A random number generator based on the addition of points on an elliptic curve over finite fields is proposed. By using the proposed generator together with the elliptic curve cryptography (ECC) algorithm, we can save hardware and software components. For hardware implementation, the proposed generator can be implemented using the existing ECC arithmetic processor. Up to 29% of gate counts can be saved when compared to the case of implementing a random number generator separately. Theoretical analyses show that periods of the proposed random number generator are sufficiently long. Moreover, the generated sequences have passed the FIPS 140-2 statistical tests. As a result, the proposed generator is suitable to be a reliable and efficient random number generator in ECC systems.

[1]  Ju-Hyun Kim,et al.  A compact finite field processor over GF(2/sup m/) for elliptic curve cryptography , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[2]  Arjen K. Lenstra,et al.  A World Wide Number Field Sieve Factoring Record: On to 512 Bits , 1996, ASIACRYPT.

[3]  J. McCaskill,et al.  Parallel random number generator for inexpensive configurable hardware cells , 2001 .

[4]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[5]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  Michael Rosing,et al.  Implementing elliptic curve cryptography , 1998 .

[7]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[8]  Joos Vandewalle,et al.  Hardware architectures for public key cryptography , 2003, Integr..

[9]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[10]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[11]  Jorge A. Gonzalez,et al.  A random number generator based on unpredictable chaotic functions , 1999 .

[12]  Gordon B. Agnew,et al.  An Implementation of Elliptic Curve Cryptosystems Over F2155 , 1993, IEEE J. Sel. Areas Commun..

[13]  Kwangjo Kim,et al.  Advances in Cryptology — ASIACRYPT '96 , 1996, Lecture Notes in Computer Science.

[14]  Daniel M. Gordon,et al.  Discrete Logarithms in GF(P) Using the Number Field Sieve , 1993, SIAM J. Discret. Math..