Fast BBS-sequence generation using Montgomery multiplication
Authors:
- 1 January 2000
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Computers and Digital Techniques
- Vol. 147 (4) , 252-254
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- THE QUADRATIC AND DOUBLE QUADRATIC RESIDUE CIPHERSCryptologia, 1995
- THE QUADRATIC RESIDUE CIPHER AND SOME NOTES ON IMPLEMENTATIONCryptologia, 1993
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Modular multiplication without trial divisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978