Secure simultaneous bit extraction from Koblitz curves

Xinxin Fan, Guang Gong, Berry Schoenmakers, Francesco Sica (Corresponding author), Andrey Sidorenko

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalDesigns, Codes and Cryptography
Volume87
Issue number1
DOIs
Publication statusPublished - 15 Jan 2019

Fingerprint

Pseudorandom number Generator
Curve
Cryptography
Output
Diffie-Hellman
Uniform distribution
Elliptic Curves
Randomness
Generator
Iteration
Experimental Results

Keywords

  • Cryptography
  • Elliptic curves
  • Pseudo-random Number generator

Cite this

Fan, Xinxin ; Gong, Guang ; Schoenmakers, Berry ; Sica, Francesco ; Sidorenko, Andrey. / Secure simultaneous bit extraction from Koblitz curves. In: Designs, Codes and Cryptography. 2019 ; Vol. 87, No. 1. pp. 1-13.
@article{c5dc592e7f364099b3f4c6b368eb3ad9,
title = "Secure simultaneous bit extraction from Koblitz curves",
abstract = "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.",
keywords = "Cryptography, Elliptic curves, Pseudo-random Number generator",
author = "Xinxin Fan and Guang Gong and Berry Schoenmakers and Francesco Sica and Andrey Sidorenko",
year = "2019",
month = "1",
day = "15",
doi = "10.1007/s10623-018-0484-3",
language = "English",
volume = "87",
pages = "1--13",
journal = "Designs, Codes and Cryptography",
issn = "0925-1022",
publisher = "Springer",
number = "1",

}

Secure simultaneous bit extraction from Koblitz curves. / Fan, Xinxin; Gong, Guang; Schoenmakers, Berry; Sica, Francesco (Corresponding author); Sidorenko, Andrey.

In: Designs, Codes and Cryptography, Vol. 87, No. 1, 15.01.2019, p. 1-13.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Secure simultaneous bit extraction from Koblitz curves

AU - Fan, Xinxin

AU - Gong, Guang

AU - Schoenmakers, Berry

AU - Sica, Francesco

AU - Sidorenko, Andrey

PY - 2019/1/15

Y1 - 2019/1/15

N2 - 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.

AB - 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.

KW - Cryptography

KW - Elliptic curves

KW - Pseudo-random Number generator

UR - http://www.scopus.com/inward/record.url?scp=85045281222&partnerID=8YFLogxK

U2 - 10.1007/s10623-018-0484-3

DO - 10.1007/s10623-018-0484-3

M3 - Article

AN - SCOPUS:85045281222

VL - 87

SP - 1

EP - 13

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

SN - 0925-1022

IS - 1

ER -