scholarly journals Min-Entropy Estimation for Semiconductor Superlattice True Random Number Generators

Author(s):  
Jing Liu ◽  
Jianguo Xie ◽  
Lu Chao ◽  
Han Wu ◽  
Peng Ding ◽  
...  

Abstract Semiconductor superlattice true random number generator (SSL-TRNG) has an outstanding practical property to serve as high-throughput and high-security cryptographic applications. Security in random number generators is closely related to the min-entropy of the raw output because feeding cryptographic applications with insufficient entropy leads to poor security and vulnerability to malicious attacks. However, no research has focused on the minimum entropy estimation based on the random model for SSL-TRNG, which is a highly recommended method for evaluating the security of a specific TRNG structure. This paper proposes a min-entropy estimation method for the SSL-TRNG by extending the Markov stochastic model derived from the memory effects. By calculating the boundary of the transition matrix, the min-entropy result is that the average value of each sample (1 bit) is 0.2487. Moreover, we demonstrate that the estimator is accurate enough to adjust compression rate dynamically in post-processing to reach the required security level, estimating entropy on the fly rather than off-line.

2021 ◽  
Vol 11 (16) ◽  
pp. 7413
Author(s):  
Maurício J. Ferreira ◽  
Nuno A. Silva ◽  
Armando N. Pinto ◽  
Nelson J. Muga

Quantum random number generators (QRNGs) are currently in high demand across a large number of cryptographic applications as secure sources of true randomness. In this work, we characterize the conditions from which randomness can be extracted in a QRNG based on homodyne measurements of vacuum fluctuations by assessing the impact of experimental limitations, such as the digitizer resolution or the presence of excess local oscillator (LO) noise due to an unbalanced detection. Moreover, we propose an estimation method to quantify the excess entropy contribution introduced by an unbalanced detection and analyze the implementation of the post-processing algorithm. Finally, we submitted the generated numbers to a set of statistical tests to assess the quality of its output randomness and verified that it passes the standard libraries.


Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Bertrand Cambou ◽  
Donald Telesca ◽  
Sareh Assiri ◽  
Michael Garrett ◽  
Saloni Jain ◽  
...  

Schemes generating cryptographic keys from arrays of pre-formed Resistive Random Access (ReRAM) cells, called memristors, can also be used for the design of fast true random number generators (TRNG’s) of exceptional quality, while consuming low levels of electric power. Natural randomness is formed in the large stochastic cell-to-cell variations in resistance values at low injected currents in the pre-formed range. The proposed TRNG scheme can be designed with three interconnected blocks: (i) a pseudo-random number generator that acts as an extended output function to generate a stream of addresses pointing randomly at the array of ReRAM cells; (ii) a method to read the resistance values of these cells with a low injected current, and to convert the values into a stream of random bits; and, if needed, (iii) a method to further enhance the randomness of this stream such as mathematical, Boolean, and cryptographic algorithms. The natural stochastic properties of the ReRAM cells in the pre-forming range, at low currents, have been analyzed and demonstrated by measuring a statistically significant number of cells. Various implementations of the TRNGs with ReRAM arrays are presented in this paper.


2014 ◽  
Vol 573 ◽  
pp. 181-186 ◽  
Author(s):  
G.P. Ramesh ◽  
A. Rajan

—Field-programmable gate array (FPGA) optimized random number generators (RNGs) are more resource-efficient than software-optimized RNGs because they can take advantage of bitwise operations and FPGA-specific features. A random number generator (RNG) is a computational or physical device designed to generate a sequence of numbers or symbols that lack any pattern, i.e. appear random. The many applications of randomness have led to the development of several different methods for generating random data. Several computational methods for random number generation exist, but often fall short of the goal of true randomness though they may meet, with varying success, some of the statistical tests for randomness intended to measure how unpredictable their results are (that is, to what degree their patterns are discernible).LUT-SR Family of Uniform Random Number Generators are able to handle randomness only based on seeds that is loaded in the look up table. To make random generation efficient, we propose new approach based on SRAM storage device.Keywords: RNG, LFSR, SRAM


Electronics ◽  
2020 ◽  
Vol 9 (5) ◽  
pp. 817
Author(s):  
Maulana Randa ◽  
Mohammad Samie ◽  
Ian K. Jennions

True Random Number Generators (TRNGs) use physical phenomenon as their source of randomness. In electronics, one of the most popular structures to build a TRNG is constructed based on the circuits that form propagation delays, such as a ring oscillator, shift register, and routing paths. This type of TRNG has been well-researched within the current technology of electronics. However, in the future, where electronics will use sub-nano millimeter (nm) technology, the components become smaller and work on near-threshold voltage (NTV). This condition has an effect on the timing-critical circuit, as the distribution of the process variation becomes non-gaussian. Therefore, there is an urge to assess the behavior of the current delay-based TRNG system in sub-nm technology. In this paper, a model of TRNG implementation in sub-nm technology was created through the use of a specific Look-Up Table (LUT) in the Field-Programmable Gate Array (FPGA), known as SRL16E. The characterization of the TRNG was presented and it shows a promising result, in that the delay-based TRNG will work properly, with some constraints in sub-nm technology.


Author(s):  
SELÇUK COŞKUN ◽  
İHSAN PEHLİVAN ◽  
AKİF AKGÜL ◽  
BİLAL GÜREVİN

The basis of encryption techniques is random number generators (RNGs). The application areas of cryptology are increasing in number due to continuously developing technology, so the need for RNGs is increasing rapidly, too. RNGs can be divided into two categories as pseudorandom number generator (PRNGs) and true random number generator (TRNGs). TRNGs are systems that use unpredictable and uncontrollable entropy sources and generate random numbers. During the design of TRNGs, while analog signals belonging to the used entropy sources are being converted to digital data, generally comparators, flip-flops, Schmitt triggers, and ADCs are used. In this study, a computer-controlled new and flexible platform to find the most appropriate system parameters in ADC-based TRNG designs is designed and realized. As a sample application with this new platform, six different TRNGs that use three different outputs of Zhongtang, which is a continuous time chaotic system, as an entropy source are designed. Random number series generated with the six designed TRNGs are put through the NIST800–22 test, which has the internationally highest standards, and they pass all tests. With the help of the new platform designed, ADC-based high-quality TRNGs can be developed fast and also without the need for expertise. The platform has been designed to decide which entropy source and parameter are better by comparing them before complex embedded TRNG designs. In addition, this platform can be used for educational purposes to explain how to work an ADC-based TRNG. That is why it can be utilized as an experiment set in engineering education, as well.


2022 ◽  
Vol 4 (2) ◽  
Author(s):  
Unsub Zia ◽  
Mark McCartney ◽  
Bryan Scotney ◽  
Jorge Martinez ◽  
Ali Sajjad

AbstractPseudo-random number generators (PRNGs) are one of the building blocks of cryptographic methods and therefore, new and improved PRNGs are continuously developed. In this study, a novel method to generate pseudo-random sequences using coupled map lattices is presented. Chaotic maps only show their chaotic behaviour for a specified range of control parameters, what can restrict their application in cryptography. In this work, generalised symmetric maps with adaptive control parameter are presented. This novel idea allows the user to choose any symmetric chaotic map, while ensuring that the output is a stream of independent and random sequences. Furthermore, to increase the complexity of the generated sequences, a lattice-based structure where every local map is linked to its neighbouring node via coupling factor has been used. The dynamic behaviour and randomness of the proposed system has been studied using Kolmogorov–Sinai entropy, bifurcation diagrams and the NIST statistical suite for randomness. Experimental results show that the proposed PRNG provides a large key space, generates pseudo-random sequences and is computationally suitable for IoT devices.


Entropy ◽  
2019 ◽  
Vol 21 (10) ◽  
pp. 960 ◽  
Author(s):  
Luyao Wang ◽  
Hai Cheng

In recent years, a chaotic system is considered as an important pseudo-random source to pseudo-random number generators (PRNGs). This paper proposes a PRNG based on a modified logistic chaotic system. This chaotic system with fixed system parameters is convergent and its chaotic behavior is analyzed and proved. In order to improve the complexity and randomness of modified PRNGs, the chaotic system parameter denoted by floating point numbers generated by the chaotic system is confused and rearranged to increase its key space and reduce the possibility of an exhaustive attack. It is hard to speculate on the pseudo-random number by chaotic behavior because there is no statistical characteristics and infer the pseudo-random number generated by chaotic behavior. The system parameters of the next chaotic system are related to the chaotic values generated by the previous ones, which makes the PRNG generate enough results. By confusing and rearranging the output sequence, the system parameters of the previous time cannot be gotten from the next time which ensures the security. The analysis shows that the pseudo-random sequence generated by this method has perfect randomness, cryptographic properties and can pass the statistical tests.


2011 ◽  
Vol 101-102 ◽  
pp. 1069-1073
Author(s):  
Hua Wei Duan ◽  
Guang Xue Chen

Raster image processor is decisive in modern digital printing machines. Three random number generators were examined for their applicabilities to raster image processor. Results show that random number generator should be carefully selected in terms of the screen cell size adopted: linear congruential generator (LCG) is the best for the screen cell size of 8 × 8 or 16 × 16; multiplicative congruential generator (MCG) is most desirable when the screen cell size equals to 6 × 6 or 12 × 12; in the case of 24 × 24 screen cell size, either LCG or MCG is optimum. The workflow of raster image processor was optimized according to our results. These findings are helpful to improve the performance of digital press that is equipped with raster image processor.


2008 ◽  
Vol 18 (03) ◽  
pp. 851-867 ◽  
Author(s):  
K. W. TANG ◽  
H. S. KWOK ◽  
WALLACE K. S. TANG ◽  
K. F. MAN

Random number generators are widely used in different applications. However, it is difficult to obtain a good random number generator in low precision and resource constrained system, such as an eight-bit micro-controller system which is still commonly used in industrial and consumer markets. This paper provides a practical solution for this problem based on chaotic systems. By the use of a modified Chua's circuit, it is demonstrated that the sampled state, after post-processing by a high-dimensional chaotic map, can be used as a random source even in an eight-bit environment. The randomness of the generated sequence is testified and confirmed by different statistical tests and the up-to-date statistical suite.


Sign in / Sign up

Export Citation Format

Share Document