THE ANALYSIS OF THE POST PROCESSING METHODS FOR THE QUANTUM RANDOM NUMBER GENERATORS
Автор: Tamari Kuchukhidze
Организация: Georgian Technical University, Scientific Cyber Security Association
Ключевые слова: quantum, post processing, quantum random number generators, entropy, randomness extractors
Аннотация. Randomness is widely used in various fields including encryption, statistical analysis and numerical simulations. They are also a fundamental resource in science and engineering. For such applications, we usually need to provide unbiased and independent random bits. This raises the issue of where to get these supposed random bits. Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. In practice, unfortunately, quantum randomness is inevitably mixed with classical randomness due to classical noise. Also, randomness is often correlated and biased. It is necessary to process the resulting raw bits sequence and convert them to good quality output values that are as close to uniform distribution as possible. Random extractors are required for this. We will analyze the randomness obtained by quantum random number generators as well as various examples of postprocessing. We discuss the types of randomness extractors.
1.M. Iavich, T. Kuchukhidze, T. Okhrimenko and S. Dorozhynskyi, "Novel Quantum Random Number Generator for Cryptographical Applications," 2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T), 2020, pp. 727-732, doi: 10.1109/PICST51311.2020.9467951.
2.M. Iavich, T. Kuchukhidze, T. Okhrimenko and S. Dorozhynskyi, "Novel Quantum Random Number Generator for Cryptographical Applications," 2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T), 2020, pp. 727-732, doi: 10.1109/PICST51311.2020.9467951.
3.E. Jintcharadze and M. Iavich, "Hybrid Implementation of Twofish, AES, ElGamal and RSA Cryptosystems," 2020 IEEE East-West Design & Test Symposium (EWDTS), 2020, pp. 1-5, doi: 10.1109/EWDTS50664.2020.9224901.
4.Kabiri Chimeh, M., Heywood, P., Pennisi, M. et al. Parallelisation strategies for agent based simulation of immune systems. BMC Bioinformatics 20, 579 (2019). https://doi.org/10.1186/s12859-019-3181-y
5.Avtandil Gagnidze, Maksim Iavich, Giorgi Iashvili// Novel Version of Merkle Cryptosystem// Bulletin of the Georgian National Academy of Sciences, vol. 11, no. 4, 2017, p. 28-33
6.P. A. W. Lewis, A. S. Goodman and J. M. Miller, "A pseudo-random number generator for the System/360," in IBM Systems Journal, vol. 8, no. 2, pp. 136-146, 1969, doi: 10.1147/sj.82.0136.
7.Lambić, D., Nikolić, M. Pseudo-random number generator based on discrete-space chaotic map. Nonlinear Dyn 90, 223–232 (2017). https://doi.org/10.1007/s11071-017-3656-1
8.J. M. Mcginthy and A. J. Michaels, "Further Analysis of PRNG-Based Key Derivation Functions," in IEEE Access, vol. 7, pp. 95978-95986, 2019, doi: 10.1109/ACCESS.2019.2928768.
9.Ma, Xiongfeng, Feihu Xu, He Xu, Xiaoqing Tan, Bing Qi, and Hoi-Kwong Lo. "Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction." Physical Review A 87, no. 6 (2013): 062327.
10.Herrero-Collantes, Miguel & Garcia-Escartin, Juan Carlos. (2016). Quantum Random Number Generators. Reviews of Modern Physics. 89. 10.1103/RevModPhys.89.015004.
11.Rožić, Vladimir, Bohan Yang, Wim Dehaene, and Ingrid Verbauwhede. "Iterating von Neumann's post-processing under hardware constraints." In 2016 IEEE international symposium on hardware oriented security and trust (HOST), pp. 37-42. IEEE, 2016.
12.De, Anindya, Christopher Portmann, Thomas Vidick, and Renato Renner. "Trevisan's extractor in the presence of quantum side information." SIAM Journal on Computing 41, no. 4 (2012): 915-940.
13.Raz, Ran, Omer Reingold, and Salil Vadhan. "Extracting all the randomness and reducing the error in Trevisan's extractors." Journal of Computer and System Sciences 65, no. 1 (2002): 97-128.
14.Stinson, Douglas Robert. Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Faculty of Mathematics, University of Waterloo, 2001.
15.Tsurumaru, Toyohiro, and Masahito Hayashi. "Dual universality of hash functions and its applications to quantum cryptography." IEEE transactions on information theory 59, no. 7 (2013): 4700-4717.