Exponentiation, Modular Multiplication and VLSI Implementation of High-Speed RSA Cryptography
DOI:
https://doi.org/10.7146/dpb.v24i499.7027Abstract
This Ph.D. thesis treats the calculation of modular exponentials using very large operands. Through a top-down approach, the basic operations are identified: modular multiplication, modular addition, addition, modular reduction, and quotient determination. Various methods and optimisation techniques for these operations are decribed and compared. The focus is directed toward methods that are suited for VLSI implementation. A very fast VLSI processor has been designed, constructed, and tested.Downloads
Published
1995-08-01
How to Cite
Orup, H. (1995). Exponentiation, Modular Multiplication and VLSI Implementation of High-Speed RSA Cryptography. DAIMI Report Series, 24(499). https://doi.org/10.7146/dpb.v24i499.7027
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.