scholarly journals RANDOM NUMBER GENERATOR BASED ON HUMAN-COMPUTER INTERACTION

2020 ◽  
pp. 17-23
Author(s):  
A. S. Averin ◽  
◽  
N. D. Zyulyarkina ◽  
E. M. Izhberdeeva ◽  
◽  
...  
Keyword(s):  
Distribution Function ◽  
Human Computer Interaction ◽  
Preliminary Analysis ◽  
Random Number ◽  
Random Number Generator ◽  
Random Numbers ◽  
Number Generator ◽  
Number Distribution ◽  
Computer Interaction

The paper is devoted to the development and analysis of a software random number gen-erator based on human-computer interaction for software and cryptographic applications. De-scribed is a method of generating random numbers based on human-computer interaction, using time and position of a cursor on a computer or smartphone display. Based on this meth-od, a random number generator has been developed and programmatically implemented. A preliminary analysis of the algorithm was performed, during which 11,000 numbers were gen-erated. The test software for this method has been created, preliminary indicators of generated random numbers have been considered. The random number distribution function is shown to be uniform. The advantage of this generator is its ease of manufacture and operation

scholarly journals A Hardware Pseudo-Random Number Generator Using Stochastic Computing and Logistic Map

Micromachines ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 31
Author(s):  
Junxiu Liu ◽  
Zhewei Liang ◽  
Yuling Luo ◽  
Lvchen Cao ◽  
Shunsheng Zhang ◽  
...  
Keyword(s):  
Random Number ◽  
Chaotic Map ◽  
Logistic Map ◽  
Random Number Generator ◽  
Alternative Methods ◽  
Random Numbers ◽  
Number Generator ◽  
Stochastic Computing ◽  
Pseudo Random Number ◽  
Pseudo Random Number Generator

Recent research showed that the chaotic maps are considered as alternative methods for generating pseudo-random numbers, and various approaches have been proposed for the corresponding hardware implementations. In this work, an efficient hardware pseudo-random number generator (PRNG) is proposed, where the one-dimensional logistic map is optimised by using the perturbation operation which effectively reduces the degradation of digital chaos. By employing stochastic computing, a hardware PRNG is designed with relatively low hardware utilisation. The proposed hardware PRNG is implemented by using a Field Programmable Gate Array device. Results show that the chaotic map achieves good security performance by using the perturbation operations and the generated pseudo-random numbers pass the TestU01 test and the NIST SP 800-22 test. Most importantly, it also saves 89% of hardware resources compared to conventional approaches.

scholarly journals RRAM Random Number Generator Based on Train of Pulses

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1831
Author(s):  
Binbin Yang ◽  
Daniel Arumí ◽  
Salvador Manich ◽  
Álvaro Gómez-Pau ◽  
Rosa Rodríguez-Montañés ◽  
...  
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Access ◽  
Pulse Amplitude ◽  
Resistive Random Access Memory ◽  
Random Numbers ◽  
Number Generator ◽  
Security Applications ◽  
Device Resistance ◽  
New Strategy

In this paper, the modulation of the conductance levels of resistive random access memory (RRAM) devices is used for the generation of random numbers by applying a train of RESET pulses. The influence of the pulse amplitude and width on the device resistance is also analyzed. For each pulse characteristic, the number of pulses required to drive the device to a particular resistance threshold is variable, and it is exploited to extract random numbers. Based on this behavior, a random number generator (RNG) circuit is proposed. To assess the performance of the circuit, the National Institute of Standards and Technology (NIST) randomness tests are applied to evaluate the randomness of the bitstreams obtained. The experimental results show that four random bits are simultaneously obtained, passing all the applied tests without the need for post-processing. The presented method provides a new strategy to generate random numbers based on RRAMs for hardware security applications.

scholarly journals Self-clocking fast and variation tolerant true random number generator based on a stochastic mott memristor

2020 ◽  
Author(s):  
Gwangmin Kim ◽  
Jae Hyun In ◽  
Hakseung Rhee ◽  
Woojoon Park ◽  
Hanchan Song ◽  
...  
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Number Generation ◽  
Harsh Environments ◽  
Random Numbers ◽  
Number Generator ◽  
High Tolerance ◽  
Stochastic Oscillation ◽  
Advanced Method ◽  
Intrinsic Stochasticity

Abstract The intrinsic stochasticity of the memristor can be used to generate true random numbers, essential for non-decryptable hardware-based security devices. Here we propose a novel and advanced method to generate true random numbers utilizing the stochastic oscillation behavior of a NbOx mott memristor, exhibiting self-clocking, fast and variation tolerant characteristics. The random number generation rate of the device can be at least 40 kbs-1, which is the fastest record compared with previous volatile memristor-based TRNG devices. Also, its dimensionless operating principle provides high tolerance against both ambient temperature variation and device-to-device variation, enabling robust security hardware applicable in harsh environments.

scholarly journals Cryptographically Secure Pseudo-Random Number Generator IP-Core Based on SHA2 Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1869 ◽  
Author(s):  
Luca Baldanzi ◽  
Luca Crocetti ◽  
Francesco Falaschi ◽  
Matteo Bertolucci ◽  
Jacopo Belli ◽  
...  
Keyword(s):  
High Performance ◽  
Random Number ◽  
Random Number Generator ◽  
Random Number Generation ◽  
Random Numbers ◽  
Generation Process ◽  
Number Generator ◽  
Ip Core ◽  
Pseudo Random Number ◽  
Pseudo Random Number Generator

In the context of growing the adoption of advanced sensors and systems for active vehicle safety and driver assistance, an increasingly important issue is the security of the information exchanged between the different sub-systems of the vehicle. Random number generation is crucial in modern encryption and security applications as it is a critical task from the point of view of the robustness of the security chain. Random numbers are in fact used to generate the encryption keys to be used for ciphers. Consequently, any weakness in the key generation process can potentially leak information that can be used to breach even the strongest cipher. This paper presents the architecture of a high performance Random Number Generator (RNG) IP-core, in particular a Cryptographically Secure Pseudo-Random Number Generator (CSPRNG) IP-core, a digital hardware accelerator for random numbers generation which can be employed for cryptographically secure applications. The specifications used to develop the proposed project were derived from dedicated literature and standards. Subsequently, specific architecture optimizations were studied to achieve better timing performance and very high throughput values. The IP-core has been validated thanks to the official NIST Statistical Test Suite, in order to evaluate the degree of randomness of the numbers generated in output. Finally the CSPRNG IP-core has been characterized on relevant Field Programmable Gate Array (FPGA) and ASIC standard-cell technologies.

scholarly journals A Novel True Random Number Generator Based on Mouse Movement and a One-Dimensional Chaotic Map

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Wang Xingyuan ◽  
Qin Xue ◽  
Teng Lin
Keyword(s):  
Random Number ◽  
Chaotic Map ◽  
Random Number Generator ◽  
Random Numbers ◽  
Number Generator ◽  
Initial Value ◽  
One Dimensional ◽  
True Random Number Generator ◽  
Mouse Movement ◽  
Real Value

We propose a novel true random number generator using mouse movement and a one-dimensional chaotic map. We utilize thex-coordinate of the mouse movement to be the length of an iteration segment of our TRNs and they-coordinate to be the initial value of this iteration segment. And, when it iterates, we perturb the parameter with the real value produced by the TRNG itself. And we find that the TRNG we proposed conquers several flaws of some former mouse-based TRNGs. At last we take experiments and test the randomness of our algorithm with the NIST statistical test suite; results illustrate that our TRNG is suitable to produce true random numbers (TRNs) on universal personal computers (PCs).

27 Random Numbers

2003 ◽  
Vol 13 (1) ◽  
pp. 235-240
Author(s):  
SIMON PEYTON JONES
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Numbers ◽  
Number Generator

27.1 The RandomGen class, and the StdGen generator  23627.2 The Random class  23927.3 The global random number generator  240

scholarly journals A Random Number Generator Using Ring Oscillators and SHA-256 as Post-Processing

2015 ◽  
Vol 61 (2) ◽  
pp. 199-204 ◽  
Author(s):  
Szymon Łoza ◽  
Łukasz Matuszewski ◽  
Mieczysław Jessa
Keyword(s):  
Random Number ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Random Numbers ◽  
Ring Oscillators ◽  
Number Generator ◽  
Post Processing ◽  
Field Programmable ◽  
Cryptographic System ◽  
Many Sources

Abstract Today, cryptographic security depends primarily on having strong keys and keeping them secret. The keys should be produced by a reliable and robust to external manipulations generators of random numbers. To hamper different attacks, the generators should be implemented in the same chip as a cryptographic system using random numbers. It forces a designer to create a random number generator purely digitally. Unfortunately, the obtained sequences are biased and do not pass many statistical tests. Therefore an output of the random number generator has to be subjected to a transformation called post-processing. In this paper the hash function SHA-256 as post-processing of bits produced by a combined random bit generator using jitter observed in ring oscillators (ROs) is proposed. All components – the random number generator and the SHA-256, are implemented in a single Field Programmable Gate Array (FPGA). We expect that the proposed solution, implemented in the same FPGA together with a cryptographic system, is more attack-resistant owing to many sources of randomness with significantly different nominal frequencies.

scholarly journals Domain Examination of Chaos Logistics Function As A Key Generator in Cryptography

2018 ◽  
Vol 8 (6) ◽  
pp. 4577
Author(s):  
Alz Danny Wowor ◽  
Vania Beatrice Liwandouw
Keyword(s):  
Relative Error ◽  
Study Design ◽  
Random Number ◽  
Random Number Generator ◽  
Title Page ◽  
Random Numbers ◽  
Number Generator ◽  
Butterfly Effect ◽  
Diffusion Properties

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p>The use of logistics functions as a random number generator in a cryptography algorithm is capable of accommodating the diffusion properties of the Shannon principle. The problem that occurs is initialization x was static and was not affected by changes in the key, so that the algorithm will generate a random number that is always the same. This study design three schemes that can providing the flexibility of the input keys in conducting the examination of the value of the domain logistics function. The results of each schemes do not show a pattern that is directly proportional or inverse with the value of x0 and relative error x and successfully fulfill the properties of the butterfly effect. Thus, the existence of logistics functions in generating chaos numbers can be accommodated based on key inputs. In addition, the resulting random numbers are distributed evenly over the chaos range, thus reinforcing the algorithm when used as a key in cryptography.</p></div></div></div>

Permutation entropy as a tool for analyzing noise-like time series

2020 ◽  
Author(s):  
Victor Panchelyuga ◽  
A. Lapshin
Keyword(s):  
Time Series ◽  
Distribution Function ◽  
Random Number ◽  
Random Number Generator ◽  
Alpha Decay ◽  
Permutation Entropy ◽  
Number Generator ◽  
High Quality ◽  
The Subject ◽  
Very High

The subject of this work is the study of time series of fluctuations or noise-like time series. Very often, such time series are considered as a standard of randomness. For example, time series of alpha decay rate fluctuations are commonly used as a very high quality random number generator. It is believed that locally such time series are completely random and do not carry any information. Therefore, the main methods of their research are global, for example, the distribution function.

Sign in / Sign up

Export Citation Format

Share Document