By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Raj S. Katti ; Department of Electrical and Computer Engineering, North Dakota State University, Fargo, 58105-5285, USA ; Rajesh G. Kavasseri

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.

Published in:

2008 IEEE International Symposium on Circuits and Systems

Date of Conference:

18-21 May 2008