Secure pseudo-random bit sequence generation using coupled linear congruential generators

Linear congruential generators (LCGs) of the form xi+1 = axi + b(mod m), have been used to generate pseudorandom numbers. However these generators have been known to be insecure. This implies that if a small sequence of numbers generated by an LCG is known then it is possible to predict the remaining numbers in the sequence that will be generated. We propose to generate a secure pseudorandom bit sequence by coupling two LCGs as follows. A 1 is output if the first LCG produces an output that is greater than the output of the second LCG and a 0 is output otherwise. The security of this sequence is shown by demonstrating the difficulty of obtaining the initial conditions of the two LCGs given the pseudorandom bit sequence output. If the modulus m is a power of 2 then efficient circuits can be designed for the proposed generators.

[1]  Xuanqin Mou,et al.  Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography , 2001, INDOCRYPT.

[2]  Werner Schindler,et al.  Random Number Generators for Cryptographic Applications , 2009, Cryptographic Engineering.

[3]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[4]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[5]  M. Blum,et al.  A simple secure pseudo-random number generator , 1982 .

[6]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[7]  Shujun Li,et al.  Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding , 2001, IMACC.

[8]  Joan Boyar,et al.  Inferring sequences produced by pseudo-random number generators , 1989, JACM.

[9]  Tommy W. S. Chow,et al.  Iterative learning control for linear time-variant discrete systems based on 2-D system theory , 2005 .

[10]  Adi Shamir,et al.  The cryptographic security of truncated linearly related variables , 1985, STOC '85.

[11]  Donald E. Knuth,et al.  Deciphering a linear congruential encryption , 1985, IEEE Trans. Inf. Theory.

[12]  Bo Sun,et al.  Using Linear Congruential Generators for Cryptographic Purposes , 2005, Computers and Their Applications.

[13]  Tamar Frankel.  [The theory and the practice...]. , 2001, Tijdschrift voor diergeneeskunde.

[14]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[15]  A. K. Lenstra,et al.  Factoring polynomials with integer coefficients , 1982 .

[16]  Igor E. Shparlinski,et al.  Predicting nonlinear pseudorandom number generators , 2004, Math. Comput..