Improved entropy bounds for parity filtered self-timed ring based random number generators

Ana I. Gomez; Markus Kiderlen; Florian Pausinger

doi:10.1016/j.ipl.2021.106212

Improved entropy bounds for parity filtered self-timed ring based random number generators

Ana I. Gomez, Markus Kiderlen, Florian Pausinger^*

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Abstract

We improve entropy bounds for a self-timed ring based true random number generator, taking the timing of the reference clock signals into account. The models we discuss encompass both perfect and jittered reference clocks. Importantly, our novel analysis of jittered reference clocks can be used to study how robust the improved entropy bounds are. We use parity filters as post-processing blocks and improve results on the required minimal parity filter size to obtain a given target entropy. In addition, we see in numerical experiments that these models are robust in the sense that the minimal required size of a parity filter to exceed a given entropy bound does not change when weakening the assumption on the reference clock; i.e. when considering jittered instead of perfect reference clocks.

Original language	English
Article number	106212
Journal	Information Processing Letters
Volume	174
ISSN	0020-0190
DOIs	https://doi.org/10.1016/j.ipl.2021.106212
Publication status	Published - Mar 2022

Keywords

Cryptography
Entropy
Self-timed ring based RNG
Stochastic model
True random number generator

Access to Document

10.1016/j.ipl.2021.106212

Cite this

@article{cb241a7b450d483c8538d9238793b088,

title = "Improved entropy bounds for parity filtered self-timed ring based random number generators",

abstract = "We improve entropy bounds for a self-timed ring based true random number generator, taking the timing of the reference clock signals into account. The models we discuss encompass both perfect and jittered reference clocks. Importantly, our novel analysis of jittered reference clocks can be used to study how robust the improved entropy bounds are. We use parity filters as post-processing blocks and improve results on the required minimal parity filter size to obtain a given target entropy. In addition, we see in numerical experiments that these models are robust in the sense that the minimal required size of a parity filter to exceed a given entropy bound does not change when weakening the assumption on the reference clock; i.e. when considering jittered instead of perfect reference clocks.",

keywords = "Cryptography, Entropy, Self-timed ring based RNG, Stochastic model, True random number generator",

author = "Gomez, {Ana I.} and Markus Kiderlen and Florian Pausinger",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2022",

month = mar,

doi = "10.1016/j.ipl.2021.106212",

language = "English",

volume = "174",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - Improved entropy bounds for parity filtered self-timed ring based random number generators

AU - Gomez, Ana I.

AU - Kiderlen, Markus

AU - Pausinger, Florian

PY - 2022/3

Y1 - 2022/3

N2 - We improve entropy bounds for a self-timed ring based true random number generator, taking the timing of the reference clock signals into account. The models we discuss encompass both perfect and jittered reference clocks. Importantly, our novel analysis of jittered reference clocks can be used to study how robust the improved entropy bounds are. We use parity filters as post-processing blocks and improve results on the required minimal parity filter size to obtain a given target entropy. In addition, we see in numerical experiments that these models are robust in the sense that the minimal required size of a parity filter to exceed a given entropy bound does not change when weakening the assumption on the reference clock; i.e. when considering jittered instead of perfect reference clocks.

AB - We improve entropy bounds for a self-timed ring based true random number generator, taking the timing of the reference clock signals into account. The models we discuss encompass both perfect and jittered reference clocks. Importantly, our novel analysis of jittered reference clocks can be used to study how robust the improved entropy bounds are. We use parity filters as post-processing blocks and improve results on the required minimal parity filter size to obtain a given target entropy. In addition, we see in numerical experiments that these models are robust in the sense that the minimal required size of a parity filter to exceed a given entropy bound does not change when weakening the assumption on the reference clock; i.e. when considering jittered instead of perfect reference clocks.

KW - Cryptography

KW - Entropy

KW - Self-timed ring based RNG

KW - Stochastic model

KW - True random number generator

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

U2 - 10.1016/j.ipl.2021.106212

DO - 10.1016/j.ipl.2021.106212

M3 - Journal article

AN - SCOPUS:85117183725

SN - 0020-0190

VL - 174

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106212

ER -

Improved entropy bounds for parity filtered self-timed ring based random number generators

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this