Research Article  Open Access
Kaiyu Wang, Qingxin Yan, Shihua Yu, Xianwei Qi, Yudi Zhou, Zhenan Tang, "High Throughput Pseudorandom Number Generator Based on Variable Argument Unified Hyperchaos", VLSI Design, vol. 2014, Article ID 923618, 9 pages, 2014. https://doi.org/10.1155/2014/923618
High Throughput Pseudorandom Number Generator Based on Variable Argument Unified Hyperchaos
Abstract
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 4way outputs, the output will be extended to 26 channels. In addition, the generated pseudorandom sequences have all passed NIST SP80022 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.
1. Introduction
Pseudorandom number (PN) is the 01 sequence which has the randomness similar to noise. It has been widely used in digital communication, cryptography, computer games, and numerical computation [1–3]. Chaos is the phenomenon which shows very complex nonlinear dynamic characteristics in a deterministic system. And it has excellent properties such as nonperiodicity, broad bandwidth, and sensitivity to initial value [4, 5]. So Chaos and PN have a natural link. And compared to other PN sequences like m sequences, and so forth, the PN sequence generated by chaotic system has advantages like larger key space, longer cycle, and so forth.
Currently, researches of chaotic pseudorandom number generator (PRNG) are more focused on the digital implementation of low dimensional chaos such as Logistic chaos, Tent chaos, and Lorenz chaos. While these algorithms have significant advantages in some respects, like simpler construction, fewer resources consuming, and faster computing speed, they also have the fatal weakness that cannot be ignored to PRNG like smaller secret key space, periodic problem, and relatively lower throughput. Therefore, implementing a PRNG based on higherorder chaos equations seems more advantage because the hyperchaos has multiple positive Lyapunov exponent and more controllable parameters and the output of system will have more complex randomness. The hyperchaotic encryption signal is harder to decode than low dimensional encryption signal [6]. And hyperchaos can provide multiple outputs, improve the throughput, and process multiple target signal [7, 8].
In 2002, Lu et al. proposed the unified chaos that can make Lorenz chaos, Lu chaos, and Chen chaos into a unified chaotic system and realize continued transition from one to another [9]. In 2011, Ma and Wang proposed the unified hyperchaos [10]. This algorithm makes the system continued transition from Lorenz hyperchaos through Lu hyperchaos to Chen hyperchaos with one system parameter changing from 0 to 1.
In this paper, we propose a novel variable parameters hyperchaotic PRNG structure which is composed by homogenized Logistic chaos and unified hyperchaos cascade. As [10] proposed the structure that needs to vary the system parameter from 0 to 1 to change chaotic class, and Logistic chaotic output is exactly between 0 and 1, so that they have a natural link. This paper uses the homogenization algorithm proposed in [11] to deal with Logistic output to provide variable parameters to the unified hyperchaos in [10]. With this method we can extend cycle of pseudorandom sequence and increase the complexity of system. And through the simple XOR processing to the output of hyperchaos, the system can generate multiple new pseudorandom sequences, greatly improving throughput. 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 PRNG output. And the output channel is increased to 26 roads. The output sequence is shown to pass the NIST SP. 80022 test suite [12] and DIEHARD test suite to indicate statistical randomness.
This paper is organized as follows: Section 2 discusses the algorithms composed of the variable argument hyperchaos and demonstrates chaotic nature; Section 3 describes the details of its implementation in hardware; Section 4 introduces the test results of the output sequence and the resource consuming after FPGA implementation; Section 5 is conclusion.
2. Proposed Variable Argument Unified Hyperchaotic PRNG
As shown in Figure 1, the proposed variable argument unified hyperchaotic PRNG is mainly composed of five modules. They are the Logistic map module which provides the parameter, homogenization module which homogenizes the output of Logistic map, unified hyperchaotic module, throughput rate choosing module which controls the number of output channel, and initial control module which controls the system. The core algorithms are the Logistic chaos, homogenization algorithm, and unified hyperchaos. Now we will discuss these three algorithms.
2.1. Logistic Chaos
Logistic chaos is one of the most studied chaos systems. It is applied in many chaos systems because of its simple description. The Logistic chaos is described as follows:
Iteration of Logistic chaos is affected by parameters and initial value . Small changes of the two values will lead to significantly different output. When is in the range , the numbers generated in successive iterations of the mapping become chaotic, and output is always between , just as bifurcation diagram Figure 2. We take to realize in hardware easily.
2.2. Homogenization Algorithm
The Logistic chaotic output in this research is homogenized to make it become a uniform pseudorandom sequence, so that the parameters input into the unified hyperchaos can be more complex and more randomness. Now, we will introduce the transform method.
The IEEE double format consists of three fields: a 52bit fraction, ; an 11bit biased exponent, ; and a 1bit sign, ; then, any real number can be expressed as the following equation:
Definition 1. Leftshift operation of , , is a new fraction obtained by discarding the leftmost bits of and then padding the result with bits 0 and 1 bit 1 on the right, if the 51stbit, 50thbit, …, ()thbit in equals zeroes, while the ()thbit in equals one.
Definition 2. The bittransformation of , : in (1), the fraction can be rewritten in the binarycoded form . Parse into higher 26bit block and lower 26bit block is as follows: Then, reverse into ; that is, Then
Now, one defines (5) as bittransformation of , .
Definition 3. Bittransformation of real numbers: suppose , represent all real numbers. The bittransformation of is defined by
Note that a bittransformation of real numbers is composed of a bittransformation and a leftshift operation, so is a multipletoone map function.
After the conversion like (6), the pseudorandom sequence can be made uniform. One realizes the homogenization algorithm on FPGA to deal with Logistic chaos. Import the output of Logistic chaos with preprocessing and postprocessing into MATLAB. The result is shown in Figure 3. It has obtained the good effect of homogenization and achieves the goal of the interference transformation, homogenization.
2.3. Unified Hyperchaos
The unified hyperchaotic system is shown as the following equations:
Obviously, when the parameter a increases from 0 to 1, the systems (7a), (7b), (7c), and (7d) evolve from hyperchaotic Lorenz system to hyperchaotic Chen system. The maximum Lyapunov exponent (MLE) and the Lyapunov dimension () are often used to measure a chaotic system in a state of chaos case or period orbit case. It is well known that the MLE and satisfy at least one MLE greater than zero and for chaos case, two MLE greater than zero, and for hyperchaos case. For systems (7a), (7b), (7c), and (7d), when , the Lyapunov exponent spectrum and the Lyapunov dimension are shown as Figures 4 and 5. As it is shown in Figure 4, all points from 0 to 1 except , there are two MLE greater than zero. And as it is shown in Figure 5, all points from 0 to 1 except , . It means the system is hyperchaotic system only except individual parameter points. And the individual bad parameter point can be removed by the means of hardware implementation.
In order to see clearly that, when the parameter a increases from 0 to 1, the systems (7a), (7b), (7c), and (7d) evolve from hyperchaotic Lorenz system to hyperchaotic Chen system, we plot the phase diagram with different parameter as shown in Figures 6 and 7.
2.4. Variable Argument Unified Hyperchaotic Algorithm
The variable argument unified hyperchaotic PRNG we proposed is based on the above three algorithms. Logistic chaos generates sequence between 0 and 1. Then, the sequence is processed by homogenization algorithm to be made uniform. After that, the uniform pseudorandom sequence is introduced as changing parameter to be imported into unified hyperchaotic system to control the output. So that the system varies in different state of hyperchaotic system and increases the output sequence cycle and has more complex dynamic characteristics and optimizes the statistical properties.
3. Hardware Implementation
To implement easily in the hardware, the differential equations (7a), (7b), (7c), and (7d) are discretized. Euler approximation has been shown to provide the best chaotic response, occupy the lowest area, and provide the highest speed compared with RungeKutta method and other methods [13]. Therefore, the Euler approximation is applied to discretize the continuoustime systems (7a), (7b), (7c), and (7d) for the digital domain:
While the chaotic systems are running in finite precision, the fixedpoint arithmetic is preferable over floating point mathematics because it requires less hardware resources and computation time. And under the same word length fixedpoint format has a higher accuracy [14, 15]. So we select fixedpoint format to represent data. Also due to the limited precision, the digital realization of chaotic systems has degradation dynamics and tends to period orbit case, namely, finite precision. Based on the theory [16] proposed that the cycle of chaotic sequence will grow exponentially with growth of format word length, we use 32bit fixedpoint number format to realize the chaotic system to prevent the finite precision effect. In unified hyperchaotic system, the fixedpoint two’s complement format is used with the 7 most significant bits for sign and integer part and the remaining for the fractional part. But Logistic chaotic system is used with the 1 most significant bit for integer part and the remaining for the fractional part as its output is always positive number.
As shown in Figure 1, the PRNG we proposed has three core algorithms: Logistic, homogenized, and unified hyperchaotic. And they are cascade structure. Therefore, this work employs a pipelined architecture between the three modules, so that the register between these three modules can be updated in each clock and increase hardware utilization efficiency.
Logistic Module is controlled by control module so that the Logistic Module outputs the same value in clock cycles. As a result of the pipeline structure, unified hyperchaotic module will read an input as a unified hyperchaotic parameter at each rising edge of the clock, so unified hyperchaotic modules will calculate the output with the same parameter in every clock cycles. So, if Logistic period is , then the entire system’s period is .
As unified hyperchaotic module has four dimensional outputs, it could provide operation space for subsequent processing. We add throughput rate choosing module after unified hyperchaotic module to make bitwise operation among the initial four outputs (). Based on the conclusion proposed in [7] about the fact that doing bitwise XOR operation on chaotic system output can get better PN sequence, in throughput rate choosing module, we do bitwise XOR operation on two different output sequences (like , , etc.) or three different output sequences (like , , etc.) or do bitwise XOR operation on ’s higher 16 bits and ’s lower 16 bits and then merge these 16 bits with ’s lower 16 bits (like , etc.) to improve the throughput. After these XOR operations, this system can provide up to 26 channels output. And this module can be configured to decide which channel or which several channels can be output.
4. Result
The proposed variable argument unified hyperchaotic PRNGis designed in Xilinx ISE 12.2 environment using Verilog HDL and experimentally verified on a Xilinx Spartan 6 XC6SLX100 FPGA. In order to fully test the output, through controlling the throughput rate choosing module, make all XOR modules work to output all 26 channels and analyze these output data with below tests.
4.1. Phase Diagram
We import the PRNG’s output into MATLAB as shown in Figure 8. From Figure 8 we can get the system is switching in different chaotic system with the number of iterations increase and parameter change; it effectively improves the complexity of output.
4.2. Correlation
Among the 26 channels output, there are 22 channels which are produced by XOR operation through 4 original outputs (). To analyze the crosscorrelation among these outputs, we import them into MATLAB. Figure 9 shows crosscorrelation result between related outputs () and original output. The results show that the XOR operation outputs are still correlated to their original channels, as indicated by a peak at zerolag. However, most peaks are below 0.5, and at other delays, crosscorrelation coefficients are below 0.3. About other crosscorrelation results, they are similar to the above one.
4.3. Pseudorandom Number Test
If the chaotic system is regarded as a PRNG, not all output bits can meet the requirements of randomness. As in the digital context, it creates an uneven distribution of pseudorandomness across the output bits. The MSBs are not only biased but also highly correlated, while the LSBs show desirable statistical randomness [17]. For this kind of situation, we first test all 32 bits. If the sequence cannot pass the tests, we will discard the highest one. Then, we will test the remaining bits. Repeat these actions until the sequence can pass tests. After tested by NIST SP80022 test suit and DIEHARD test suit, test results show that in the 26 channels of FPGA output, 12 channels can pass tests with all 32 bits and other 14 channels can pass with lower 20 bits. So, as a PRNG, we make the system output 32 bits in 12 channels and output lower 20 bits in other 14 channels. And from the test result of DIEHARD, we can get the conclusion that the quality from higher to lower is , and original 4 outputs.
We take the lower 20 bits NIST test results and DIEHARD test results as the representative list in this paper, in Tables 1 and 2. The remaining 22 roads also pass the tests but not list in this paper. In conclusion, the PRNG we proposed can provide as high as 26 channels output and 13.49 Gbits/s throughput.
 
Length of bit = 1000000, number of bit streams = 100, and confidence level = 99%. 

4.4. Hardware Resource Utilization
After the FPGA synthesis, Slice Registers resources utilization rate is 1%, Slice LUTs is 5%, and DSP block is 55%. The designed system can provide 26way output with 32 bits. Taking into account the pipeline structure influence, the throughput of system is as high as 16.91 Gbits/s at maximum clock frequency. And its random number throughput rate is as high as 13.49 Gbits/s. Specific numbers of resource consumption and throughput are shown in Table 3. To make the quantitative analysis on the resource consumption and throughput, we adopt the following definition. Gate count is estimated as and the area efficiency is assessed through a figure of merit determined as . The PRNG proposed in this paper is compared with several low dimensional chaotic PRNG in Table 4. From Table 4 we can get that although this work spent higher hardware resource than low dimensional chaotic PRNG, we get much higher throughput and higher FOM.

5. Conclusion
In this paper, we propose a novel variable parameters hyperchaotic PRNG structure which is composed of homogenized Logistic chaos and unified hyperchaos cascade. Take the homogenized Logistic chaotic output as the unified hyperchaotic parameter to make the output sequence in different chaotic system. In this way, system will be more complex and have longer period. At the same time, add a throughput rate control module after the output of the unified hyperchaotic module, through simple XOR processing; the output of the 4 road hyperchaos can be extended to 26 road and greatly improve the throughput of the system. The PRNGis designed in Xilinx ISE 12.2 environment using Verilog HDL and experimentallyverified on a Xilinx Spartan 6 FPGA. The throughput is up to 16.91 Gbits/s for the chaotic system. As a PRNG, it can provide 26 channels output as pseudorandom sequence which all pass NIST SP80022 test and DIEHARD test. And its random number throughput rate is as high as 13.49 Gbits/s.
Therefore, due to the variable argument unified hyperchaotic PRNG has advantages like high output complexity, multidimensional output, and high throughput rate; it is very suitable for being applied to multiobjective signal processing field like multiobjective control and secure communications, and so forth.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
 Q. Rong and Y. Fang, “Pseudo random sequence generator based on variable structure chaos,” Modern Electronics Technique, vol. 35, no. 11, pp. 64–67, 2012. View at: Google Scholar
 H. P. Ren, The design of chaotic key system based on FPGA [M.S. dissertation], Dalian Maritime University, Ganjingzi, China, 2011.
 P. Dabal and R. Pelka, “FPGA implementation of chaotic pseudorandom bit generators,” in Proceedings of the 19th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES '12), pp. 260–264, Warsaw, Poland, May 2012. View at: Google Scholar
 P. Li, Z. Li, W. A. Halang, and G. Chen, “A multiple pseudorandombit generator based on a spatiotemporal chaotic map,” Physics Letters A, vol. 349, no. 6, pp. 467–473, 2006. View at: Publisher Site  Google Scholar
 K. Wang, W. Pei, H. Xia, and Y. Cheung, “Pseudorandom number generator based on asymptotic deterministic randomness,” Physics Letters A, vol. 372, no. 24, pp. 4388–4394, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 H. Wang, L. Cheng, and J.H. Peng, “Application of hyperchaos to encrypting digital signals,” Journal of Northeast Normal University (Natural Science Edition), vol. 32, no. 2, pp. 31–35, 2000. View at: Google Scholar
 A. S. Mansingka, M. Affan Zidan, M. L. Barakat, A. G. Radwan, and K. N. Salama, “Fully digital jerkbased chaotic oscillators for high throughput pseudorandom number generators up to 8.77 Gbits/s,” Microelectronics Journal, vol. 44, no. 9, pp. 744–752, 2013. View at: Publisher Site  Google Scholar
 F. JinQing, “Several advances in chaosbased communication and research of information security associated with networks,” Journal of Systems Engineering, vol. 25, no. 6, pp. 725–741, 2010. View at: Google Scholar
 J. H. Lu, G. R. Chen, and D. Z. Cheng, “Bridge the gap between the Lorenz system and the Chen system,” International Journal of Bifurcation and Chaos, vol. 12, no. 12, pp. 2917–2926, 2002. View at: Publisher Site  Google Scholar  MathSciNet
 C. Ma and X. Wang, “Bridge between the hyperchaotic Lorenz system and the hyperchaotic Chen system,” International Journal of Modern Physics B, vol. 25, no. 5, pp. 711–721, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 S. LiYuan, X. YanYu, and Z. Sheng, “How homogenize Chaosbased Pseudorandom sequences,” in Proceedings of the International Conference on Computer Science and Software Engineering (CSSE '08), pp. 793–796, December 2008. View at: Publisher Site  Google Scholar
 A. Rukhin, J. Soto, M. Smid et al., “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” NIST Special Publication 80022, 2010. View at: Google Scholar
 M. A. Zidan, A. G. Radwan, and K. N. Salama, “The effect of numerical techniques on differential equation based chaotic generators,” in Proceedings of the 23rd International Conference on Microelectronics (ICM '11), pp. 1–4, Hammamet, Tunisia, December 2011. View at: Publisher Site  Google Scholar
 A. Pande and J. Zambreno, “A chaotic encryption scheme for realtime embedded systems: design and implementation,” Telecommunication Systems, vol. 52, no. 2, pp. 551–561, 2013. View at: Publisher Site  Google Scholar
 L. Wang, W. Liu, H. Shi, and J. M. Zurada, “Cellular neural networks with transient chaos,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 54, no. 5, pp. 440–444, 2007. View at: Publisher Site  Google Scholar
 B. Zhang, Performance analysis and optimization of chaotic PN sequence [M.S. thesis], Hangzhou Dianzi University, Jianggan, China, 2009.
 M. L. Barakat, A. S. Mansingka, A. G. Radwan, and K. N. Salama, “Generalized hardware postprocessing technique for chaosbased pseudorandom number generators,” ETRI Journal, vol. 35, no. 3, pp. 448–458, 2013. View at: Publisher Site  Google Scholar
 S. Chen, T. Hwang, and W. Lin, “Randomness enhancement using digitalized modified logistic map,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 57, no. 12, pp. 996–1000, 2010. View at: Publisher Site  Google Scholar
 C.Y. Li, T.Y. Chang, and C.C. Huang, “A nonlinear PRNG using digitized logistic map with selfreseeding method,” in Proceedings of the International Symposium on VLSI Design, Automation and Test (VLSIDAT '10), pp. 108–111, April 2010. View at: Publisher Site  Google Scholar
 S. L. Chen, T. Hwang, S.M. Chang, and W.W. Lin, “A fast digital chaotic generator for secure communication,” International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, vol. 20, no. 12, pp. 3969–3987, 2010. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2014 Kaiyu Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.