pseudo random number generator
Recently Published Documents


TOTAL DOCUMENTS

240
(FIVE YEARS 27)

H-INDEX

21
(FIVE YEARS 0)

Author(s):  
Roman Senkerik ◽  
Michal Pluhacek ◽  
Zuzana Kominkova Oplatkova

This research deals with the initial investigations on the concept of a chaos-driven evolutionary algorithm Differential evolution. This paper is aimed at the embedding of simple two-dimensional chaotic system, which is Lozi map, in the form of chaos pseudo random number generator for Differential Evolution. The chaotic system of interest is the discrete dissipative system. Repeated simulations were performed on standard benchmark Schwefel’s test function in higher dimensions. Finally, the obtained results are compared with canonical Differential Evolution.



2021 ◽  
Author(s):  
Conor Ryan ◽  
Meghana Kshirsagar ◽  
Gauri Vaidya ◽  
Andrew Cunningham ◽  
R Sivaraman

Abstract This work investigates the potential of evolving an initial seed with Grammatical Evolution (GE), for the construction of cryptographically secure (CS) pseudo-random number generator (PRNG). We harness the flexibility of GE as an entropy source for returning initial seeds. The initial seeds returned by GE demonstrate an average entropy value of 7.920261600000001 which is extremely close to the ideal value of 8. The initial seed combined with our proposed approach, control_flow_incrementor, is used to construct both, GE-PRNG and GE-CSPRNG.The random numbers generated with CSPRNG meet the prescribed National Institute of Standards and Technology (NIST) SP800-22 requirements. Monte Carlo simulations established the efficacy of the PRNG. The experimental setup was designed to estimate the value for pi, in which 100,000,000 random numbers were generated by our system and which resulted in returning the value of pi to 3.146564000, with a precision up to six decimal digits. The random numbers by GE-PRNG were compared against those generated by Python’s rand() function for sampling. The sampling results, when measured for accuracy against twenty-nine real world regression datasets, showed that GE-PRNG had less error when compared to Python’s rand() against the ground truths in seventeen of those, while there was no discernible difference in the remaining twelve.



2021 ◽  
Author(s):  
Radosław Cybulski

Pseudo-random number generation techniques are an essential tool to correctly test machine learning processes. The methodologies are many, but also the possibilities to combine them in a new way are plenty. Thus, there is a chance to create mechanisms potentially useful in new and better generators. In this paper, we present a new pseudo-random number generator based on a hybrid of two existing generators - a linear congruential method and a delayed Fibonacci technique. We demonstrate the implementation of the generator by checking its correctness and properties using chi-square, Kolmogorov and TestU01.1.2.3 tests and we apply the Monte Carlo Cross Validation method in classification context to test the performance of the generator in practice.



2021 ◽  
Author(s):  
David Selvakumar ◽  
J Mervin ◽  
Shashikala Pattanshetty ◽  
D Vivian


Author(s):  
Mangal Deep Gupta ◽  
R. K. Chauhan

This paper introduces an FPGA implementation of a pseudo-random number generator (PRNG) using Chen’s chaotic system. This paper mainly focuses on the development of an efficient VLSI architecture of PRNG in terms of bit rate, area resources, latency, maximum length sequence, and randomness. First, we analyze the dynamic behavior of the chaotic trajectories of Chen’s system and set the parameter’s value to maintain low hardware design complexity. A circuit realization of the proposed PRNG is presented using hardwired shifting, additions, subtractions, and multiplexing schemes. The benefit of this architecture, all the binary multiplications (except [Formula: see text] and [Formula: see text] operations are performed using hardwired shifting. Moreover, the generated sequences pass all the 15 statistical tests of NIST, while it generates pseudo-random numbers at a uniform clock rate with minimum hardware complexity. The proposed architecture of PRNG is realized using Verilog HDL, prototyped on the Virtex-5 FPGA (XC5VLX50T) device, and its analysis has been done using the Matlab tool. Performance analysis confirms that the proposed Chen chaotic attractor-based PRNG scheme is simple, secure, and hardware efficient, with high potential to be adopted in cryptography applications.



2021 ◽  
Vol 11 (4) ◽  
pp. 7483-7488
Author(s):  
M. F. Hyder ◽  
. Waseemullah ◽  
M. U. Farooq ◽  
U. Ahmed ◽  
W. Raza

Static IP addresses make the network vulnerable to different attacks and once the machines are compromised, any sensitive information within the network can be spoofed. Moving Target Defense (MTD) provides an efficient mechanism for proactive security by constantly changing different system attributes. Software Defined Networks (SDNs) provide greater flexibility in designing security solutions due to their centralized management and programming capabilities. In this paper, a mechanism for the protection of endpoint security is developed using IP address host shuffling. In the proposed approach, the real IP address of the host is masked and a virtual IP address is assigned. The virtual IPs are mined from the pool of unassigned IP addresses. The address pool is created using a pseudo-random number generator to guarantee high randomness. This approach helps in invalidating the intelligence gathered by the adversaries through the changes in the network configuration that will disturb attack execution, eventually leading to attack failure. Transparency is attained via preserving the actual IP intact and mapping a virtual IP to it. The proposed solution is implemented using the RYU Controller and Mininet. The efficient results obtained from the experiments substantiate the effectiveness of the MTD approach for enhancing endpoint security.



Sign in / Sign up

Export Citation Format

Share Document