Still faster modular multiplication

Still faster modular multiplication

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

By an appropriate choice of the modulus used in RSA cryptography, it is possible to simplify the hardware for performing the required modular multiplication steps, and thereby increase the speed of encryption and decryption. The author considers this when the algorithm of Montgomery is used.


    1. 1)
      • R.L. Rivest , A. Shamir , L. Adleman . A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM , 120 - 126
    2. 2)
      • E.F. Brickell , Chaum . (1983) A fast modular multiplication algorithm with application to two-key cryptography, Advances in Cryptology - CRYPTO '82.
    3. 3)
      • P.L. Montgomery . Modular multiplication without trial division. Math. Comput. , 519 - 521
    4. 4)
      • R. Solovay , V. Strassen . A fast Monte-Carlo test for primality. SIAM J. Comput. , 84 - 85
    5. 5)
      • C.D. Walter . (1992) Faster modular multiplication by operand scaling, Advances in Cryptology - CRYPTO '91, Lecture Notes in Comp. Sci..
    6. 6)
      • S.E. Eldridge , C.D. Walter . Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Trans. , 693 - 699

Related content

This is a required field
Please enter a valid email address