scholarly journals METHOD FOR DEVELOPING PSEUDO-RANDOM NUMBER GENERATORS FOR CRYPTOGRAPHIC APPLICATIONS IN 5G NETWORKS

2021 ◽  
Vol 12 (4) ◽  
pp. 151-162
Author(s):  
Sergiy Gnatyuk ◽  
Yuliia Burmak ◽  
Rat Berdibayev ◽  
Marek Aleksander ◽  
Dinara Ospanova

Today, pseudo-random number generators are used in various systems and applications, including as key generators in stream ciphers. The implementation of the latest information and communication technologies (in particular, 5G networks) strengthens the requirements for ensuring the confidentiality of critical data and forces the development of new methods and means for cryptographic protection. Existing generators, like other cryptographic algorithms, do not meet the requirements for processing speed and security against known types of attacks. From this position, in the paper a method for constructing pseudo-random sequence generators was developed. It allows to build efficient generators for cryptographic applications. Based on this method, software generators of pseudo-random numbers have been developed and implemented. These will be useful for cryptographic applications in modern 5G networks. The developed pseudo-random number generators have passed complex statistical testing by the NIST STS technique (showed results not worse than the results of known pseudo-random sequence generators used in practice to solve similar problems). Besides, they are faster in comparison with analogues used today in 5G networks (for example, with algorithms SNOW and Trivium). In further works it is planned to investigate the security of the developed pseudo-random generators against different types of cryptanalytic attacks, as well as to simulate the work of the developed pseudo-random sequence generators using the base station equipment of modern 5G networks.

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 16149-16164 ◽  
Author(s):  
Borja Bordel ◽  
Amalia Beatriz Orue ◽  
Ramon Alcarria ◽  
Diego Sanchez-De-Rivera

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.


2017 ◽  
Vol 90 (3) ◽  
pp. 1661-1670 ◽  
Author(s):  
Luis Gerardo de la Fraga ◽  
Esteban Torres-Pérez ◽  
Esteban Tlelo-Cuautle ◽  
Cuauhtemoc Mancillas-López

1992 ◽  
Vol 5 (4) ◽  
pp. 291-305 ◽  
Author(s):  
D. Ugrin-Šparac

The renewal process generated by the uniform distribution, when interpreted as a transformation of the uniform distribution into a discrete distribution, gives rise to the question of uniqueness of the inverse image. The paper deals with a particular problem from the described domain, that arose in the construction of a complex stochastic test intended to evaluate pseudo-random number generators. The connection of the treated problem with the question of a unique integral representation of Gamma-function is also mentioned.


MENDEL ◽  
2018 ◽  
Vol 24 (2) ◽  
Author(s):  
Tomas Brandejsky

This paper analyses the influence of experiment parameters onto the reliability of experiments with genetic programming algorithms. The paper is focused on the required number of experiments and especially on the influence of parallel execution which affect not only the order of thread execution but also behaviors of pseudo random number generators, which frequently do not respect recommendation of C++11 standard and are not implemented as thread safe. The observations and the effect of the suggested improvements are demonstrated on results of 720,000 experiments.


Sign in / Sign up

Export Citation Format

Share Document