Still faster modular multiplication

Colin D. Walter · Electronics Letters · 1995

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.

Read the paper · More papers on PaperTik