Sarad Venugopalan Home Page

Welcome to
Tuesday, October 17 2017 @ 08:33 PM UTC

Cryptanalysis of Linear Congruence Generators

ArticlesMultiplicative congruential generators have been first suggested by D.H.Lehmer as an arithmetic procedure to generate pseudo random numbers. A mild variation of it is the linear congruence generator. Over many years both these generators were widely used in simulations and reported to have good statistical properties and favorable cycle length. Cryptanalysts have come up with numerous complex methods to cryptanalyze the generators mentioned above. We discuss a simple method to cryptanalyze both multiplicative and linear congruence generators, which make them unsuitable as raw input to simulations and various cryptosystem. Note: This work is attributed to [1].

Read PDF

Story Options

Cryptanalysis of Linear Congruence Generators | 0 comments | Create New Account
The following comments are owned by whomever posted them. This site is not responsible for what they say.