Fig 1 - uploaded by Nahlah Mohammed
Content may be subject to copyright.
![The random time of arrival of consecutive photons for an attenuated pulsed laser [4].](profile/Nahlah-Mohammed/publication/321167182/figure/fig1/AS:633137855991810@1527963236979/The-random-time-of-arrival-of-consecutive-photons-for-an-attenuated-pulsed-laser-4.png)
Source publication
True random number generators are essential components for communications to be confidentially secured. In this paper a new method is proposed to generate random sequences of numbers based on the difference of the arrival times of photons detected in a coincidence window between two single-photon counting modules.
Contexts in source publication
Context 1
... . The choice of a small value of μ (i.e., = μ 0.1) is required to obtain a reasonable approximation to a single photon source. In practice, a pulsed laser exhibiting Poissonian photon number fluctuations is greatly attenuated, so that only a very small fraction of pulses ∼ μ 2 /2 contains an average of two or more photons. However, this situation is obtained at the expense of a large fraction of pulses ∼ − μ (1 ) containing an average of no photons. The arrival time of the photons is illustrated in Fig. 1, which is an oscilloscope trace for a pulsed laser source attenuated such that = μ 0.1 (an average of one photon per ten pulses) ...
Context 2
... exhibiting Poissonian photon number fluctuations is greatly attenuated, so that only a very small fraction of pulses ∼ μ 2 /2 contains an average of two or more photons. However, this situation is obtained at the expense of a large fraction of pulses ∼ − μ (1 ) containing an average of no photons. The arrival time of the photons is illustrated in Fig. 1, which is an oscilloscope trace for a pulsed laser source attenuated such that = μ 0.1 (an average of one photon per ten pulses) ...
Similar publications
We use the framework of dependence to assess the benefits of scrambling randomly versus deterministically for Faure and Halton sequences. We attempt to answer the following questions: when a deterministic sequence has known defects for small sample sizes, should we address these defects by applying random scrambling or should we find a "good" deter...
Citations
... These methods included utilizing atmospheric noise, radioactive decay, or electronic noise as sources of randomness. The advent of modern computer hardware and the increasing availability of random number generation hardware modules further facilitated the generation of high-quality random numbers (Dhanuskodi et al., 2014;Elmanfaloty & Abou-Bakr, 2019;Hasan et al., 2018;Karakaya et al., 2019;Park et al., 2015;Rezk et al., 2019;Yu, Wan et al., 2019;Zhou et al., 2020). ...
Uncertainty, an inherent characteristic of our reality, serves as a compelling rationale for favoring simulation modeling over deterministic calculations when striving to make reliable predictions for systems characterized by inherent stochasticity. Random number generators that use computational algorithms can produce values based on random distributions by utilizing an initial seed value to calculate unlimited sequences of random numbers. By employing a deterministic approach to generate seemingly random numbers, we can ensure the reproducibility of stochastic models at any given time, a critical aspect for simulation modelling. However, the use of random number streams in modelling and simulation can have some pitfalls which may even mislead experienced developers. This article not only provides an overview of the history of random number generators but also offers practical modelling instructions on how to improve their use in order to produce accurate and dependable scenario comparisons.
... Random numbers play a crucial role in fields such as cryptography [1], data simulation [2], and secure communications [3][4][5][6][7][8][9]. They can be categorized into two types: true random numbers [10,11] and pseudo random numbers [12,13]. True random numbers, also known as physical random numbers, are generated through physical phenomena. ...
In this paper, we propose using a chaotic system composed of nanolasers (NLs) as a physical entropy source. Combined with post-processing technologies, this system can produce high-quality physical random number sequences. We investigated the parameter range for achieving time-delay signature (TDS) concealment in the chaotic system. This study demonstrates that NLs exhibit noticeable TDS only under optical feedback. As mutual injection strength between the master NLs (MNLs) increases, the TDS of the MNLs is gradually suppressed until they are completely concealed. Compared to MNLs, the slave NL (SNL) exhibits better TDS suppression performance. Additionally, we investigated the chaotic and highly unpredictable regions of the SNL, demonstrating that high-quality chaotic signals can be produced over a wide range of parameters. Using TDS hidden and highly unpredictable chaotic signals as the source of random entropy, the effects of different post-processing techniques on random number extraction were compared. The results indicate that effective post-processing can enhance the unpredictability of the random sequence. This study successfully utilized NLs for random number generation, showcasing the potential and application prospects of NLs in the field of random numbers.
... Consequently, systems relying on pseudo random number encryption are susceptible to attacks and security risks. Physical random numbers [11,12] are generated by using physical phenomena in nature as entropy sources, exhibiting a high degree of unpredictability. The main types of physical entropy sources include thermal noise [13,14], phase jitter in oscillating signals [15][16][17], chaos [18][19][20][21], and others. ...
This paper presents a chaotic system based on novel semiconductor nanolasers (NLs), systematically analyzing its chaotic region and investigating the influence of key parameters on the unpredictability of chaotic output. This study found that under optical feedback conditions, NLs generate chaos across a wide range of feedback parameters, with the highly unpredictable region completely overlapping with the chaotic region. Further injection into the slave lasers enhances the chaotic output, expanding the range of unpredictability. Additionally, we analyzed the impact of internal parameter mismatch on the complexity of chaotic signals and found it to be similar to the scenario when parameters are matched. Using this chaotic system as an entropy source, we constructed a random number generator (RNG) and investigated the effects of internal parameters mismatch and differences in the injection parameters on the generator’s performance. The simulation results show that the RNG performs well under different parameter settings, and the generated random sequences pass all random number tests successfully. Therefore, this chaotic system can yield a high-complexity chaotic light source with appropriate parameter selection, and when combined with effective post-processing, it can generate high-quality random numbers. This is crucial for advancing the realization of small-sized, high-randomness RNGs.
... We refer to Equation (16) as the inverse-reverse relation. To prove the theorem, we need the following lemmas. ...
... Corollary 2. Theorem 2, i.e. the inverse-reverse relation defined in (16), remains valid also in case of non-zero dead time. ...
The performance analysis of a quantum random number generator (QRNG), operating based on the interarrival time differences between consecutive photon detections from a coherent light source, is presented. The proposed analysis approach accurately takes into account the physical properties of the single‐photon detection systems, such as discretised time measurement, the correlations induced by the asynchronous arrival of photons with respect to the time resolution grid, and the dead time after observations and provides the QRNG's relevant performance measures, such as the joint distribution of bits, lag‐r correlations, the bit generation overhead and the bit generation time. Analysis results are verified by computer simulations.
... Because the indeterminate physical processes are completely determined by the dynamic parameters of the system, this type of entropy is categorized as dynamic entropy. True random number generators (TRNGs) extract the dynamic entropy from random and microscopic fluctuations in physical processes (thermal noise, shot noise, avalanches, clock drift, jitter, atmospheric noise, external electromagnetics, quantum phenomena, etc.), which can generate independent, uniformly distributed, unpredictable random numbers [7,8]. The pseudo random number generator (PRNG) is another type of random number generator, also known as deterministic random bit generator (DRBG), used to produce keys. ...
Entropy is a measure of uncertainty or randomness. It is the foundation for almost all cryptographic systems. True random number generators (TRNGs) and physical unclonable functions (PUFs) are the silicon primitives to respectively harvest dynamic and static entropy to generate random bit streams. In this survey paper, we present a systematic and comprehensive review of different state-of-the-art methods to harvest entropy from silicon-based devices, including the implementations, applications, and the security of the designs. Furthermore, we conclude the trends of the entropy source design to point out the current spots of entropy harvesting.
... A real laser emits light that can be described by a coherent state and in this case the photon detections follows a Poisson process. This has been used to build cryptographic protocols [10]. A more realistic description of the Mach-Zehnder interferometer is as follows. ...
Information theory is built on probability measures and by definition a probability measure has total mass 1. Probability measures are used to model uncertainty, and one may ask how important it is that the total mass is one. We claim that the main reason to normalize measures is that probability measures are related to codes via Kraft's inequality. Using a minimum description length approach to statistics we will demonstrate with that measures that are not normalized require a new interpretation that we will call the Poisson interpretation. With the Poisson interpretation many problems can be simplified. The focus will shift from from probabilities to mean values. We give examples of improvements of test procedures, improved inequalities, simplified algorithms, new projection results, and improvements in our description of quantum systems.
... The block diagram represented in Figure 1 contains operations like addition, multiplication, addition, comparison and subtraction. To simplify the work process; the circuit is intended using the 'word lengths' lessening method that has recommended in [13][14][15][16][17][18][19][20][21][22][23][24][25]. Then comparator and subtractor blocks can be merged, as shown in Figure 2. ...
p>Arbitrary numerals are utilized in a wide range of uses. Genuine arbitrary numeral generators are moderate and costly for some applications while pseudo arbitrary numeral generators (RNG) do the trick for most applications. This paper fundamentally concentrates around the co-simulation of the linear congruential generator (LCG) model utilizing the Xilinx System generator and checking on Matlab Simulink. The design is obtained from the LCG calculation offered by Lehmer. Word lengths decrease strategy has been utilized to streamline the circuit. Simulation has been done effectively. The effective N bit LCG is structured and tried by utilizing demonstrating in MatLab Simulink. The Co-simulation of the model is done by utilizing the Xilinx system generator. This paper conducts an exhaustive search for the best arbitrary numeral generator in a full period linear congruential generator (LCG) with the largest prime numbers.</p
... The sequences are usually, but not always, whitened using advanced postprocessing algorithms. [9][10][11][12][13][14] The generator in Ref. 15 is somewhat out of the ordinary since it applies a deterministic extraction algorithm to intermediate groups of symbols from a four-letter alphabet, rather than to a raw bitstream. The methods with higher (>100 Mbps) bit generation rates either belong to the second group 11,12 or achieve it through parallel bit generation using a large array of single-photon detectors, 7 while most of the others are capable of several Mbps. ...
The bit generation algorithm of a quantum random number generator based on photon arrival time differences is improved in terms of the bit generation efficiency and bit generation rate. The method is analyzed mathematically, proving that, in theory, the improved generator still produces random numbers of high quality without the need of resorting to postprocessing algorithms. The effects of nonidealities are quantitatively analyzed to provide bounds for the maximum tolerable deviations from uniformity. Experimental investigations are conducted on a prototype, showing that the method is capable of increasing the rate of bit generation by more than 47% on the same physical architecture.
... A Distribuição de Chaves Quânticas ou Quantum Key Distribution (QKD) utiliza propriedades quânticas para trocar informações sigilosas, que podem ser utilizadas para criptografar dados e/ou mensagens. De maneira geral, a segurança do QKD é baseada no conhecimento de que o ato de medir um sistema quântico é o mesmo que perturbá-lo (HASAN et al., 2017). Assim, caso a mensagem seja interceptada, uma troca quântica inevitavelmente deixará traços detectáveis, indicando a quebra do sigilo da mensagem. ...
... A Distribuição de Chaves Quânticas ou Quantum Key Distribution (QKD) utiliza propriedades quânticas para trocar informações sigilosas, que podem ser utilizadas para criptografar dados e/ou mensagens. De maneira geral, a segurança do QKD é baseada no conhecimento de que o ato de medir um sistema quântico é o mesmo que perturbá-lo (HASAN et al., 2017). Assim, caso a mensagem seja interceptada, uma troca quântica inevitavelmente deixará traços detectáveis, indicando a quebra do sigilo da mensagem. ...
No YouTube os autores apresentam seus capítulos em curtos vídeos:
https://www.youtube.com/channel/UCBMnCtjga0nwjmzGSwxWhtw/playlists
