Abstract
A congruential generator is an algorithm that yields a sequence of integers, it is defined by an arbitrary first term (seed) x 0, and by a simple mathematical recursion relation which containing three parameters (a, c, m) which must satisfy the kunth criterias. The aim of this work is to propose a crypto system based on a new adaptation of the linear congruential generator in this case, it must be able to produce an indistinguishable output of a perfect randomly and, must withstand of different attacks. Also, it must be able to pass the test of the following bit, that is to say that there is no polynomial time algorithm such that knowing the first L bits of the sequence S, we can deduce the (L + 1)th bit from S with a probability greater than 0.5. There are several techniques for the construction of such a generator, we envisaged to use a linear combination of these linear congruential generators which are adapted to the cryptography.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
