Research of the Methods for Improving Performance for Cryptographically Strong BBS Pseudorandom Bit Sequences Generators

Andrii Malohlovets1 maloglovets [at] gmail.com
Volodymyr Maxymovych2 volodymyr.maksymovych [at] gmail.com
  1. Department of Information Technology Security, Lviv Polytechnic National University, UKRAINE, Lviv, S. Bandery street 12
  2. Department of Information Technology Security, Lviv Polytechnic National University, UKRAINE, Lviv, S. Bandery street 12
Abstract 

The aim of this work is the research of methods for improving the performance on cryptographically strong BBS generators, their practical realization and analysis of their efficiency

Keywords 
BBS
improving performance
computational complexity
efficiency of parallelizing
K-stream generator
References 

[1] Blum, Lenore; Blum, Manuel; Shub, Mike (1982). "Comparison of Two Pseudo-Random Number Generators". Advances in Cryptology: Proceedings of CRYPTO '82. Plenum: 61–78.
[2] Lenore Blum, Manuel Blum, and Michael Shub. «A Simple Unpredictable Pseudo-Random Number Generator», SIAM Journal on Computing, volume 15, pages 364—383, May 1986.
[3] Lenore Blum, Manuel Blum, and Michael Shub. «A Simple Unpredictable Pseudo-Random Number Generator», SIAM Journal on Computing, volume 15, pages 364—383, May 1986.
[4] Andrew Rukhin, et. al. «A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications», NIST ITL Special Publication 800-22 (Apr 2010)