Abstract
In this paper, after a short survey describing several known constructions recommended for generating sequences of pseudo-random numbers based on elliptic curves over finite fields of prime order, we propose a method of generating such sequences of points with algorithms driven by a chaotic map. Our construction improves randomness of the sequence generated since it combines good statistical properties of an ECPRNG (Elliptic Curve Pseudo-Random Number Generator) and a CPRNG (Chaotic Pseudo-Random Number Generator). Theoretical analysis shows that periods of the proposed constructions are longer than in the case of the ECPRNG without modulation by a chaotic map. In the second part of the paper we present numerical analysis of the proposed construction to obtain optimal parameters of the generator. We also use some tests from the NIST’s SP 800-22 Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications to analyze statistical properties of the proposed constructions for different values of parameters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic, Dordrecht (1993)
Lee, L.P., Wong, K.W.: A random number generator based on elliptic curve operations. Journal of Computers and Mathematics with Applications 47, 217–226 (2004)
Jao, D., Jetchev, D., Venkatesan, R.: On the bits of elliptic curve Diffie-Hellman keys. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 33–47. Springer, Heidelberg (2007)
Kaliski, B.S.: One-way permutations on elliptic curves. Journal of Cryptology 3, 187–199 (1991-1992)
Caragiu, M., Johns, R.A., Gieseler, J.: Quasi-random structures from elliptic curves. J. Algebra, Number Theory Appl. 6, 561–571 (2006)
Gong, G., Berson, T.A., Stinson, D.R.: Elliptic curve pseudorandom sequence generators. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, p. 34. Springer, Heidelberg (2000)
Habutsu, T., Nishio, Y., Sasase, I., Mori, S.: A secret key cryptosystem by iterating a chaotic map. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 127–140. Springer, Heidelberg (1991)
Biham, E.: Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT’91. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 532–534. Springer, Heidelberg (1991)
Kotulski, Z., Szczepański, J.: Discrete chaotic cryptography. Annalen der Physik 6(5), 381–394 (1997)
Kohda, T., Tsuneda, A.: Statistic of chaotic binary sequences. IEEE Transactions on Information Theory 43(1), 104–112 (1997)
Kotulski, Z., Szczepański, J., Górski, K., Paszkiewicz, A., Gorska, A.: On constructive approach to chaotic pseudorandom number generators. In: Proceedings RCMIS 2000, Zegrze, October 4-6, vol. 1, pp. 191–203 (2000)
Reyad, O., Kotulski, Z.: On Pseudo-random Number Generators Using Elliptic Curves and Chaotic Systems. Applied Mathematics & Information Sciences 9(1) (2015) (accepted paper)
Cornfeld, L.P., Fomin, S.V., Sinai, Y.G.: Ergodic Theory. Springer, Berlin (1982)
Kotulski, Z., Szczepański, J.: Pseudorandom number generators based on chaotic dynamical systems. Open Systems & Information Dynamics 8(2), 137–146 (2001)
FIPS 140-2: Security Requirements for Cryptographic Modules, NIST (2000)
Rukhin, A., Soto, J., Nechvatal, J., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22 with revisions (May 15, 2001)
Knuth, D.E.: The Art of Computer Programming - Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1981)
Blake, I., Seroussi, G., Smart, N.: Elliptic curves in cryptography. London Math. Soc., Lecture Note Series, vol. 265. Cambridge Univ. Press (1999)
Silverman, J.H.: The arithmetic of elliptic curves. Springer, Berlin (1995)
Hallgren, S.: Linear congruential generators over elliptic curves. Preprint CS-94-143, Dept. of Comp. Sci., Cornegie Mellon Univ., 1–10 (1994)
Shparlinski, I.E.: Pseudorandom number generators from elliptic curves. In: Affine Algebraic Geometry, pp. 121–142. Amer. Math. Soc. (2009)
Amigo, J.M., Kocarev, L., Szczepański, J.: Theory and Practice of Chaotic Cryptography. Physics Letters A 366(3), 211–216 (2007)
Phatak, S.C., Rao, S.S.: Logistic map: A possible random-number generator. Physical Review E 51(4), 3670–3678 (1995)
Liao, X.F., Li, X.M., Peng, J., et al.: A digital secure image communication scheme based on the chaotic Chebyshev map. Int. J. Commun. Syst. 17(5), 437–445 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reyad, O., Kotulski, Z. (2014). Statistical Analysis of the Chaos-Driven Elliptic Curve Pseudo-random Number Generators. In: Kotulski, Z., Księżopolski, B., Mazur, K. (eds) Cryptography and Security Systems. CSS 2014. Communications in Computer and Information Science, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44893-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-44893-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44892-2
Online ISBN: 978-3-662-44893-9
eBook Packages: Computer ScienceComputer Science (R0)