Cover
Vol. 12 No. 2 (2017)

Published: January 31, 2017

Pages: 155-160

Original Article

A Pseudorandom Binary Generator Based on Chaotic Linear Feedback Shift Register

Saad Muhi Falih 1
1Department of Computer Technical Engineering Islamic University College Al Najaf al Ashraf, Iraq
History
  • Received: November 30, 2016
  • Available Online: January 31, 2017
DOI

https://doi.org/10.37917/ijeee.12.2.5

Abstract

This paper presents a simple method for the design of Chaotic Linear Feedback Shift Register (CLFSR) system. The proposed method is based on a combination of two known systems. The first is called Linear Feedback Shift Register (LFSR) system, and the other is called Chaotic Map system. The main principle of the proposed system is that, the output of the LFSR is modified by exclusive-or (XOR) it with the stream bit that is generated by using the chaotic map system to eliminate the linearity and the repeating in the output of the LFSR system. The proposed system is built under Matlab environment and the quality of sequence generation tested by using standard tests which shows that the proposed system is a good random number generator that overcome the linearity and repeating disadvantages.

Keywords

References

  1. J. M. Bahi et. al., “Evaluating Quality of Chaotic Pseudo-Random Application to Hiding,” Vol. 4, No. 1 , 2011, pp.118-130.
  2. R. Z. Khalaf and A. A. Abdullah, "Generate Quantum Key by Using Quantum Shift Register," International Journal of Computer Vol.12 No.2 , 2016 Networks and Communications Security, Vol. 3, No. 6, June 2015, pp.248-252.
  3. P. P. Deepthi and P. S. Sathidevi, "Hardware Stream Cipher Based on LFSR and Modular Division Circuit," International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering, Vol. 2, No. 10, 2008, pp. 2251-2259.
  4. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, " Handbook of Applied Cryptography", CRC Press, Boca Raton, Florida, USA, 1997.
  5. A. Vlad et. al. "Generating Chaotic Secure Sequences Using Tent Map and a RunningKey Approach," Volume 14, Special Issue 2013, pp. 295–302.
  6. D. Arroyo, G. Alvarez, J. M. Amigo and S. Li, "Cryptanalysis of a family of selfsynchronizing chaotic stream ciphers," Communications in Nonlinear Science and Numerical Simulation, Vol. 16, No.2, 2011, pp. 805–813.
  7. M. Babaei and M. Ramyar, "Improved Performance of LFSR's System with Discrete Chaotic Iterations," World Applied Sciences Journal, Vol. 13, No. 7, 2011, pp. 1720-1725.
  8. F. Masoodi, S. Alam, and M. U. Bokhari, "An Analysis of Linear Feedback Shift Registers in Stream Ciphers," International Journal of Computer Applications, Vol. 46, No.17, May 2012, pp.46-49.
  9. C. Paar, J. Pelzl, B. Preneel, "Understanding Cryptography: A Textbook for Students and Practitioners," Springer, New York, 2010.
  10. S. Golomb, "Shift Register Sequence," Aegean Park Press, Laguna Hills, CA, 1982.
  11. A. Ahmad, N. K. Nanda, K. Garg, "Are Primitive Polynomials Always Best Signature Analysis?," IEEE Design & Test, Vol. 7, Issue. 4, July 1990, pp. 36-38.
  12. A. Ahmad, A. M. Elabdalla, " An efficient method to determine linear feedback connections in shift registers that generate maximal length pseudo-random up and down binary sequences," Computers & Electrical Engineering, Vol. 23, Issue. 1, Jan. 1997, pp. 33-39.
  13. P. Alfke, Application Note: "Efficient Shift Registers, LFSR Counters, and Long PseudoRandom Sequence Generators," Technical report, Xilinx Inc., San Jose, CA, App. note XApp052, 1996.
  14. S. Azou, G. Burel, and C. Pistre, "A Chaotic Direct-Sequence Spread-Spectrum System for Underwater Communication," Oceans'2002, Biloxi, Mississippi, October 2931, 2002.
  15. S. E. Borujeni and M. S. Ehsani, "Modified Logistic Maps for Cryptographic Application," Applied Mathematics, Vol. 6, 2015, pp. 773782.
  16. S. S. Pratt, "Bifurcations Are Not Always Exclusive," Journal of Complexity and Education, Vol. 5, No. 1, 2008, pp. 125-128.
  17. L. Min, T. Chen, and H. Zang, "Analysis of FIPS 140-2 Test and Chaos-Based Pseudorandom Number Generator," Proce. of the 5th Chaotic Modeling and Simulation pp. 345-352. Vol.12 No.2 , 2016 Table III Randomness Test of the Different Systems Studies System Under Test Monobit Test Poker Test Runs Test Long Runs Test L=1 L=2 L=3 L=4 L=5 L=6 Acceptance * Range 9,725 - 10,275 2.16 - 46.17 2,315 - 2,685 1,114 - 1,386 527 - 723 240 - 384 103 - 209 103 - 209 Logistic map (1) system 10074 10.992 2490 1223 Quadratic map (2) system 10168 12.9632 2453 1268 LFSR system 9999 -0.9312 2499 1245 CLFSR based on (1) 9995 15.824 2630 1205 CLFSR based on (2) 10029 12.0672 2420 1276 * The test results must be located in the range of acceptance to ensure that the sequence under test is random. Table IV The Simple Visual Analysis of the Different Systems Studies Chaotic Map system LFSR system CLFSR system Logistic map Quadratic map Vol.12 No.2 , 2016