Two-faced processes and random number generators

TL;DR

This paper introduces two-faced binary processes that, despite having low entropy, produce sequences indistinguishable from true randomness, enabling the construction of theoretically guaranteed random number generators crucial for cryptography.

Contribution

It presents a novel class of processes that mimic true randomness with low entropy, offering new methods for secure random number generation.

Findings

Processes with entropy less than 1 can mimic true randomness

Construction of RNGs with theoretical guarantees

Potential applications in cryptography

Abstract

We describe random processes (with binary alphabet) whose entropy is less than 1 (per letter), but they mimic true random process, i.e., by definition, generated sequence can be interpreted as the result of the flips of a fair coin with sides that are labeled 0 and 1. It gives a possibility to construct Random Number Generators which possess theoretical guarantees. This, in turn, is important for applications such as those in cryptography.