Itamaracá: A Novel Simple Way to Generate Pseudo-random Numbers

Author(s):  
Daniel Henrique Pereira

In this paper was presented Itamaracá, a novel simple way to generate pseudo random numbers. In general vision we can say that Itamaracá tends to pass in some statistical tests like frequency, chi square, autocorrelation, run sequence and run test. As an effect to comparison also was taking into account the results of the function R and Between by Microsoft Excel and true random numbers by Random Org analyzed its distinctive characteristics as well as with the proposal model. In this sense, the goal of this study is contributing to growing the existing Pseudo Random Number Generators (PRNGs) portfolio.

2021 ◽  
Author(s):  
Daniel Henrique Pereira

In this paper was presented Itamaracá, a novel simple way to generate pseudo random numbers. In general vision we can say that Itamaracá tends to pass in some statistical tests like frequency, chi square, autocorrelation, run sequence and run test. As an effect to comparison also was taking into account the results of the function R and Between by Microsoft Excel and true random numbers by Random Org analyzed its distinctive characteristics as well as with the proposal model. In this sense, the goal of this study is contributing to growing the existing Pseudo Random Number Generators (PRNGs) portfolio.


2020 ◽  
Vol XXIII (1) ◽  
pp. 248-252
Author(s):  
Veronica Cornaciu

The generation of random numbers is a important topic in cryptography. Random number generators are bradly divided into two categories: random number generators(RNGs) and pseudo-random number generators(PRNGs). If the PRNGs werw intensively studied in the specialized literature, many such generators being built and analyzed, the topic of RNGs did not capture the researchers atention so much. Candidates in this first category generate nondeterministic sequences and are often based on physical reactions, such as radioactive degradation or mouse movement. A special category of generators is the one that combines the two categories, namely, the category of hybrid generators (HRGs). The purpose of this paper is to study in detail the category of hybrid generators and to provide a detailed analysis of the results of statistical tests, security , portability and how to improve some of the generators of this category.


2018 ◽  
Author(s):  
Samuel Toluwalope Ogunjo ◽  
Emmanuel Jesuyon Dansu ◽  
Oluwagbenga Olukanye-David ◽  
Ibiyinka Agboola Fuwape

The ability of humans to generate numbers that are really random has always been a subject of debate. This paper investigated the possibility for a group of humans to serve as random number generators. A total of 2344 students, who were not pre-informed to avoid bias, from different faculties within the Federal University of Technology Akure were asked to chose a random number between 1 and 10. Using various statistical tests, we sought answers to the possibility of predictors like participant’s test score, gender, age and school influencing their choice of random numbers. We discovered that the numbers generated are highly random and chaotic despite number 1 being the most selected number across all predictors that was considered. Our study found that gender, test score, age did not significantly influence the choice of number while faculty showed a significant relation α < 0.05.


2021 ◽  
Vol 13 (2) ◽  
pp. 10-18
Author(s):  
Botond L. Márton ◽  
Dóra Istenes ◽  
László Bacsárdi

Random numbers are of vital importance in today’s world and used for example in many cryptographical protocols to secure the communication over the internet. The generators producing these numbers are Pseudo Random Number Generators (PRNGs) or True Random Number Generators (TRNGs). A subclass of TRNGs are the Quantum based Random Number Generators (QRNGs) whose generation processes are based on quantum phenomena. However, the achievable quality of the numbers generated from a practical implementation can differ from the theoretically possible. To ease this negative effect post-processing can be used, which contains the use of extractors. They extract as much entropy as possible from the original source and produce a new output with better properties. The quality and the different properties of a given output can be measured with the help of statistical tests. In our work we examined the effect of different extractors on two QRNG outputs and found that witg the right extractor we can improve their quality.


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.


In this chapter, the author considers existing methods and means of forming pseudo-random sequences of numbers and also are described the main characteristics of random and pseudorandom sequences of numbers. The main theoretical aspects of the construction of pseudo-random number generators are considered. Classification of pseudorandom number generators is presented. The structures and models of the most popular pseudo-random number generators are considered, the main characteristics of generators that affect the quality of the formation of pseudorandom bit sequences are described. The models of the basic mathematical generators of pseudo-random numbers are considered, and also the principles of building hardware generators are presented.


Author(s):  
Kentaro Tamura ◽  
Yutaka Shikano

Abstract A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition from the output. A framework to achieve this exists in the field of random number generation in the form of statistical tests for random number generators. In the present study, we generated random numbers on a 20-qubit cloud quantum computer and evaluated the condition and stability of its qubits using statistical tests for random number generators. As a result, we observed that some qubits were more biased than others. Statistical tests for random number generators may provide a simple indicator of qubit condition and stability, enabling users to decide for themselves which qubits inside a cloud quantum computer to use.


2020 ◽  
Author(s):  
Scott Stoller

Random numbers are an important, but often overlooked part of the modern computing environment. They are used everywhere around us for a variety of purposes, from simple decision making in video games such as a coin toss, to securing financial transactions and encrypting confidential communications. They are even useful for gambling and the lottery. Random numbers are generated in many ways. Pseudo random number generators (PRNGs) generate numbers based on a formula. True random number generators (TRNGs) capture entropy from the environment to generate randomness. As our society and our devices become more connected in the digital world, it is important to develop new ways to generate truly random numbers in order to secure communications and connected devices. In this work a novel memristor-based True Random Number Generator is designed and a physical implementation is fabricated and tested using a W-based self-directed channel (SDC) memristor. The circuit was initially designed and prototyped on a breadboard. A custom Printed Circuit Board (PCB) was fabricated for the final circuit design and testing of the novel memristor-based TRNG. The National Institute of Standards and Technology (NIST) Statistical Test Suite (STS) was used to check the output of the TRNG for randomness. The TRNG was demonstrated to pass 13 statistical tests out of the 15 in the STS.


2021 ◽  
Author(s):  
Kayvan Tirdad

Pseudo random number generators (PRNGs) are one of the most important components in security and cryptography applications. We propose an application of Hopfield Neural Networks (HNN) as pseudo random number generator. This research is done based on a unique property of HNN, i.e., its unpredictable behavior under certain conditions. Also, we propose an application of Fuzzy Hopfield Neural Networks (FHNN) as pseudo random number generator. We compare the main features of ideal random number generators with our proposed PRNGs. We use a battery of statistical tests developed by National Institute of Standards and Technology (NIST) to measure the performance of proposed HNN and FHNN. We also measure the performance of other standard PRNGs and compare the results with HNN and FHNN PRNG. We have shown that our proposed HNN and FHNN have good performance comparing to other PRNGs accordingly.


In this chapter, the author considers the main theoretical solutions for the creation of pseudo-random number generators based on one-dimensional cellular automata. A Wolfram generator is described on the basis of rule 30. The main characteristics of the Wolfram generator is presented. The analysis of hybrid pseudo-random number generators based on cellular automata is carried out. Models of such generators and their realization with various forms of neighborhoods are presented. Also in the chapter is presented the analysis of the basic structures and characteristics of pseudo-random number generators using additional sources of pseudo-random numbers. As such additional sources the LFSR is used.


Sign in / Sign up

Export Citation Format

Share Document