|
Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2025, Volume 521, Pages 11–22 DOI: https://doi.org/10.31857/S2686954325010026
(Mi danma614)
|
|
|
|
MATHEMATICS
On the extraction of random bit sequences in quantum random number generators with several independent Markov sources
I. M. Arbekova, S. N. Molotkovabc a Academy of Cryptography of Russian Federation
b Osipyan Institute of Solid State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region
c Lomonosov Moscow State University
DOI:
https://doi.org/10.31857/S2686954325010026
Abstract:
The paper presents a method for extracting provably random bit sequences from several independent trajectories of circuits Markov, each of which has an arbitrary finite order. The combined use of several trajectories makes it possible in practice, when implementing quantum randomnumber generators, to significantly increase the speed of generating output bit sequences.
Keywords:
quantum random number generators, random sequences, Markov chains, provable randomness.
Citation:
I. M. Arbekov, S. N. Molotkov, “On the extraction of random bit sequences in quantum random number generators with several independent Markov sources”, Dokl. RAN. Math. Inf. Proc. Upr., 521 (2025), 11–22; Dokl. Math., 111:1 (2025), 6–15
Linking options:
https://www.mathnet.ru/eng/danma614 https://www.mathnet.ru/eng/danma/v521/p11
|
|