Paper 2018/595

Randomness analysis for multiple-recursive matrix generator

Subhrajyoti Deb, Bubu Bhuyan, and Sartaj Ul Hasan


Randomness testing of binary sequences generated by any keystream generator is of paramount importance to both designer and attacker. Here we consider a word-oriented keystream generator known as multiple-recursive matrix generator, which was introduced by Niederreiter (1993). Using NIST statistical test suite as well as DieHarder statistical package, we analyze randomness properties of binary sequences generated by multiple-recursive matrix generator and show that these sequences are not really adequate for any cryptographic applications. We also propose nonlinearly filtered multiple-recursive matrix generator based a special nonlinear function and establish that sequences generated by such a nonlinearly filtered multiple-recursive matrix generator provide good randomness results. Moreover, we compare our randomness test results with some of the recent lightweight stream ciphers like Lizard, Fruit, and Plantlet.

Available format(s)
-- withdrawn --
Publication info
ecret-key cryptographyLinear feedback shift registerstream cipherrandomnessword-oriented feedback shift registerMRMGNIST STSDieHarder
Contact author(s)
sartaj hasan @ iitjammu ac in
2018-07-17: withdrawn
2018-06-18: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.