scholarly journals High Throughput Pseudorandom Number Generator Based on Variable Argument Unified Hyperchaos

VLSI Design ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Kaiyu Wang ◽  
Qingxin Yan ◽  
Shihua Yu ◽  
Xianwei Qi ◽  
Yudi Zhou ◽  
...  
Keyword(s):  
High Throughput ◽  
Standard Test ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Hyperchaotic System ◽  
Number Generator ◽  
Maximum Throughput ◽  
Verilog Hdl ◽  
Pseudorandom Sequences ◽  
Different Chaotic Systems

This paper presents a new multioutput and high throughput pseudorandom number generator. The scheme is to make the homogenized Logistic chaotic sequence as unified hyperchaotic system parameter. So the unified hyperchaos can transfer in different chaotic systems and the output can be more complex with the changing of homogenized Logistic chaotic output. Through processing the unified hyperchaotic 4-way outputs, the output will be extended to 26 channels. In addition, the generated pseudorandom sequences have all passed NIST SP800-22 standard test and DIEHARD test. The system is designed in Verilog HDL and experimentally verified on a Xilinx Spartan 6 FPGA for a maximum throughput of 16.91 Gbits/s for the native chaotic output and 13.49 Gbits/s for the resulting pseudorandom number generators.

scholarly journals Simple method of selecting totalistic rules for pseudorandom number generator based on nonuniform cellular automaton

2021 ◽  
Author(s):  
Miroslaw Szaban
Keyword(s):  
Cellular Automaton ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Large Set ◽  
Number Generator ◽  
Pseudorandom Sequences ◽  
Simple Method ◽  
One Dimensional ◽  
Simple Selection ◽  
Selection Of

AbstractThis paper is devoted to selecting rules for one-dimensional (1D) totalistic cellular automaton (TCA). These rules are used for the generation of pseudorandom sequences, which could be useful in cryptography. The power of pseudorandom number generator (PRNG) based on nonuniform TCA can be improved using not only one rule but a large set of rules. For this purpose, each subset of rules should be analyzed with its assignation to cellular automaton (CA) cells should be analyzed. We examine each of the subsets of totalistic rules, consisting of rules with neighborhood radius equal to 1 and 2. The entropy of bitstreams generated by the nonuniform TCA points out the best set of rules appropriate for the TCA-based generator. The paper also presents the method of simple selection of CA rules based on a cryptographic criterion known as a balance. The proposed method selects a maximal size of the set of available CA rules for a given neighborhood radius and suitable for PRNG. The method guarantees to avoid conflicting assignments of rules resulting in the creation of unwanted stable bit sequences, and provides high-quality pseudorandom sequences. This technique is used to verify the subsets of rules selected experimentally. Verified rules are proposed for 1D TCA-based PRNG as a new subset of best nonuniform TCA rules. New picked, examined, and verified subset of rules could be used in TCA-based PRNG and provide cryptographically strong bit sequences and huge keyspace.

scholarly journals Beyond Statistical Analysis in Chaos-Based CSPRNG Design

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
John Prakash Arockiasamy ◽  
Lydia Elizabeth Benjamin ◽  
Rhymend Uthariaraj Vaidyanathan
Keyword(s):  
Statistical Analysis ◽  
Statistical Tests ◽  
Security Analysis ◽  
Statistical Testing ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Pseudorandom Sequences ◽  
Randomness Test ◽  
Modern Cryptography

The design of cryptographically secure pseudorandom number generator (CSPRNG) producing unpredictable pseudorandom sequences robustly and credibly has been a nontrivial task. Almost all the chaos-based CSPRNG design approaches invariably depend only on statistical analysis. Such schemes designed to be secure are being proven to be predictable and insecure day by day. This paper proposes a design and instantiation approach to chaos-based CSPRNG using proven generic constructions of modern cryptography. The proposed design approach with proper instantiation of such generic constructions eventually results in providing best of both worlds that is the provable security guarantees of modern cryptography and passing of necessary statistical tests as that of chaos-based schemes. Also, we introduce a new coupled map lattice based on logistic-sine map for the construction of CSPRNG. The proposed pseudorandom number generator is proven using rigorous security analysis as that of modern cryptography and tested using the standard statistical testing suites. It is observed that the generated sequences pass all stringent statistical tests such as NIST, Dieharder, ENT, and TestU01 randomness test suites.

scholarly journals Pseudorandom Number Generator Based on Three Kinds of Four-Wing Memristive Hyperchaotic System and Its Application in Image Encryption

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Xi Chen ◽  
Shuai Qian ◽  
Fei Yu ◽  
Zinan Zhang ◽  
Hui Shen ◽  
...  
Keyword(s):  
Image Encryption ◽  
Secure Communication ◽  
Encryption Algorithm ◽  
Statistical Characteristics ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Hyperchaotic System ◽  
Number Generator ◽  
Encrypted Image ◽  
Different Dimensions

In this paper, we propose a method to design the pseudorandom number generator (PRNG) using three kinds of four-wing memristive hyperchaotic systems (FWMHSs) with different dimensions as multientropy sources. The principle of this method is to obtain pseudorandom numbers with good randomness by coupling XOR operation on the three kinds of FWMHSs with different dimensions. In order to prove its potential application in secure communication, the security of PRNG based on this scheme is analyzed from the perspective of cryptography. In addition, PRNG has passed the NIST 800.22 and ENT test, which shows that PRNG has good statistical characteristics. Finally, an image encryption algorithm based on PRNG is adopted. In the encryption algorithm, the optimized Arnold matrix scrambling method and the diffusion processing based on XOR are used to obtain the final encrypted image. Through the evaluation of encryption performance, it is concluded that there is no direct relationship between the pristine image and encrypted image. The results show that the proposed image encryption scheme has good statistical output characteristics and security performance in line with cryptography.

scholarly journals Encryption of pseudorandom number generator logic circuits

2021 ◽  
Vol 190 ◽  
pp. 370-376
Author(s):  
Mikhail Ivanov ◽  
Iliya Chugunkov ◽  
Bogdana Kliuchnikova ◽  
Evgenii Salikov
Keyword(s):  
Logic Circuits ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator
Sign in / Sign up

Export Citation Format

Share Document