Abstract
The algorithm of the Blum-Blum-Shub, BBS, generator is cryptographically secure pseudorandom number generator. The paper investigates the design and FPGA prototype of modified Blum-Blum-Shub pseudorandom sequence generator. The goal of the design is to have number of cycles for modified BBS algorithm close to classic BBS algorithm. Since BBS algorithm based on large integer modular multiplication, the FPGA prototype uses the Montgomery multiplication algorithm. It was established that it is possible to generate sequence with modified BBS algorithm, which has better repetition period and statistical characteristics, for the same number of cycles in compared to classic BBS algorithm, but with additional number of circuits.
Sign-in/Register to access full text options 
Free) 
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 call
