FAST MODULAR MULTIPLICATION AND PARALLEL ALGORITHMS IN PUBLIC-KEY CRYPTOSYSTEMS

摘要

A modular multiplication is one of the most important operations in public-key cryptography like RSA cryptosystem. This paper is just devoted to a practical method and construction of speeding up such operation. Furthermore, the modular multiplication expansions are given and based on these expansions the fast modular multiplication and parallel algorithms are proposed.