2023/03/23 by Charlene Kalle, Kalle, Charlene, Evgeny Verbitskiy +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Chaos-based Image/Signal Encryption #Dynamical Systems (math.DS) #FOS: Mathematics #Fractal and DNA sequence analysis #Physical Unclonable Functions (PUFs) and Hardware Security
paper · pdf · doi:10.48550/arxiv.2303.13170
openalex publication_date 2023/03/23 · openalex created_date 2023/03/25 · openalex updated_date 2026/07/28
The β-encoder is an analog circuit that converts an input signal x ∈ [0,1] into a finite bit stream \bi\. The bits \bi\ are correlated and therefore are not immediately suitable for random number generation, but they can be used to generate bits \ai\ that are (nearly) uniformly distributed. In this article we study two such methods. In the first part the bits \ai\ are defined as the digits of the base-2 representation of the original input x. Under the assumption that there is no noise in the amplifier we then study a question posed by Jitsumatsu and Matsumura on how many bits b1, …, bm are needed to correctly determine the first n bits a1,…,an. In the second part we show this method fails for random amplification factors. Nevertheless, even in this case, nearly uniformly distributed bits can still be generated from b1,…,bm using modern cryptographic techniques.