Fast BBS-sequence generation using Montgomery multiplication
Matthew Geoffrey Parker, Andrew H. Kemp, Simon J. Shepherd · IEE Proceedings - Computers and Digital Techniques · 2000
VLSI modules are proposed for fast, efficient generation of high-throughput Blum–Blum-Shub (BBS) and BBS-like sequences using Montgomery multiplication, where postprocessing associated with Montgomery's algorithm can be eliminated.