Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen

12.04.2018 | Ausgabe 1/2019

Designs, Codes and Cryptography 1/2019

Secure simultaneous bit extraction from Koblitz curves

Designs, Codes and Cryptography > Ausgabe 1/2019
Xinxin Fan, Guang Gong, Berry Schoenmakers, Francesco Sica, Andrey Sidorenko
Wichtige Hinweise
Communicated by S. D. Galbraith.
The author X. Fan work was done when the author was a research associate at the University of Waterloo. The author F. Sica project is financially supported by the grant of the Corporate Fund “Fund of Social Development”


Secure pseudo-random number generators (PRNGs) have a lot of important applications in cryptography. In this paper, we analyze a new PRNG related to the elliptic curve power generator. The new PRNG has many desirable randomness properties such as long period, uniform distribution, etc. In particular, the proposed PRNG is provably secure under the l-strong Diffie–Hellman assumptions. An important feature of our PRNG is that many bits can be simultaneously output without significantly affecting its security. For instance, at 150-bit security, more than 100 bits can be output at each iteration, with a statistical distance from a uniform sequence less than \(1/2^{150}\). Our experimental results show that the new PRNG provides a secure and flexible solution for high security applications. Hence, our work is another step towards the construction of provably secure PRNGs in practice.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Über diesen Artikel

Weitere Artikel der Ausgabe 1/2019

Designs, Codes and Cryptography 1/2019 Zur Ausgabe

Premium Partner