Applied Mathematics & Information Sciences
Abstract
Elliptic Curve Cryptography (ECC) is a relatively recent branch of cryptography which is based on the arithmetic on elliptic curves and security of the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Elliptic curve cryptographic schemes are public-key mechanisms that provide encryption, digital signature and key exchange capabilities. Elliptic curve algorithms are also applied to generation of sequences of pseudo-random numbers. Another recent branch of cryptography is chaotic dynamical systems where security is based on high sensitivity of iterations of maps to initial conditions and parameters. In the present work, we give a short survey describing state-of-the-art of several suggested constructions for generating sequences of pseudorandom number generators based on elliptic curves (ECPRNG) over finite fields of prime order. In the second part of the paper we propose a method of generating sequences of pseudorandom points on elliptic curves over finite fields which is driven by a chaotic map. Such a construction improves randomness of the sequence generated since it combines good statistical properties of an ECPRNG and a CPRNG (Chaotic Pseudo- Random Number Generator). The algorithm proposed in this work is of interest for both classical and elliptic curve cryptography.
Digital Object Identifier (DOI)
http://dx.doi.org/10.12785/amis/090105
Recommended Citation
Reyad, Omar and Kotulski, Zbigniew
(2023)
"On Pseudo-Random Number Generators Using Elliptic Curves and Chaotic Systems,"
Applied Mathematics & Information Sciences: Vol. 09:
Iss.
1, Article 12.
DOI: http://dx.doi.org/10.12785/amis/090105
Available at:
https://digitalcommons.aaru.edu.jo/amis/vol09/iss1/12