Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Practical Entropy Accumulation for Random Number Generators with Image Sensor-Based Quantum Noise Sources

Version 1 : Received: 15 June 2023 / Approved: 16 June 2023 / Online: 16 June 2023 (04:32:21 CEST)

A peer-reviewed article of this Preprint also exists.

Choi, Y.; Yeom, Y.; Kang, J.-S. Practical Entropy Accumulation for Random Number Generators with Image Sensor-Based Quantum Noise Sources. Entropy 2023, 25, 1056. Choi, Y.; Yeom, Y.; Kang, J.-S. Practical Entropy Accumulation for Random Number Generators with Image Sensor-Based Quantum Noise Sources. Entropy 2023, 25, 1056.

Abstract

The efficient generation of high-quality random numbers is essential in the operation of cryptographic modules. The quality of a random number generator is evaluated by the min-entropy of its entropy source. Typical method used to achieve high min-entropy of the output sequence is an entropy accumulation based on a hash function. This is grounded in the famous Leftover Hash Lemma which guarantees a lower bound on the min-entropy of the output sequence. However, the hash function based entropy accumulation has slow speed in general. For a practical perspective we need a new efficient entropy accumulation with the theoretical background for the min-entropy of the output sequence. In this work, we obtain the theoretical bound for the min-entropy of the output random sequence through the very efficient entropy accumulation using only bitwise XOR operations, where the input sequences from the entropy source are independent. Moreover we examine our theoretical results by applying to the quantum random number generator that uses dark noise arising from image sensor pixels as its entropy source.

Keywords

Entropy accumulation; Random Number Generator; Quantum random noises

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.