System and method for communicating encrypted messages using RSA with modular reduction to provide fast decryption

摘要

The communication system uses two key numbers d and e and two prime numbers p and q such that N=p*q. Also 1modf(N)=e*d where f(N) is the Euler indicator. The message is deciphered using a module which is determined from the prime numbers p and q available to produce a modular reduction p-1,q-1. A second modular reduction is then performed. A modular exponent is then applied to the reduced deciphered message having the same modular exponent as the partially deciphered message. This final step restores the original message.