Nonquadratic variation of the Blum-Blum-Shub Pseudorandom Number Generator
Download
Author
Knuth, Thomas
Date
2016-09Advisor
Stanica, Pantelimon
Second Reader
Martinsen, Thor
Metadata
Show full item recordAbstract
Cryptography is essential for secure online communications. Many different types of ciphers are implemented in modern-day cryptography, but they all have one common factor. All ciphers require a source of randomness, which makes them unpre-dictable. One such source of this randomness is a random number generator. This thesis focuses on Pseudorandom Number Generators (PRNG), specifically, a PRNG called Blum-Blum-Shub (BBS). In this thesis, we make two modifications to BBS, and test our modified generators for randomness using the National Institute of Standards and Technology (NIST) tests. The original BBS is a quadratic generator that generates bits based on the output of squaring terms in a sequence. The first modification replaces the quadratic generator with a cubic generator. The second modification generates bits faster by using more bits per iteration. Data collected in this thesis suggests that the cubic modification performs just as well as the original generator. In addition, data from this thesis suggests that taking more bits per iteration can speed up this process while retaining randomness. In addition, we propose a new cryptosystem based upon the modification of the BBS PRNG introduced in this thesis.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
DIVIDE AND CONQUER MODIFICATION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR
Gillespie, Daniel K. (Monterey, CA; Naval Postgraduate School, 2023-06);The Blum-Micali pseudorandom number generator (PRNG) outputs cryptographically secure sequences of pseudorandom bits. One of the primary drawbacks of the Blum-Micali PRNG is that it can be computationally expensive and ... -
Generalized Boolean functions as combiners
Di Nallo, Oliver (Monterey, California: Naval Postgraduate School, 2017-06);In this digital age, cryptography has formed the backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit between two parties as well as many other critical ... -
DOUBLE PENDULUM CHAOTIC MODEL FOR PSEUDORANDOM NUMBER GENERATION
Hard, Ryan C. (Monterey, CA; Naval Postgraduate School, 2020-03);The double pendulum is a system of two connected masses, one tethered to a point in space and the other tethered to the first mass. The double pendulum exhibits chaotic motion under the influence of an external force such ...