Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call