Speeding Up Bipartite Modular Multiplication

Download Now
Provided by: Springer Healthcare
Topic: Security
Format: PDF
A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this paper. By considering state of the art attacks on public-key cryptosystems, the authors show that the proposed set is safe to use in practice for both elliptic curve cryptography and RSA cryptosystems. They propose a hardware architecture for the modular multiplier that is based on their method. The results show that, concerning the speed, their proposed architecture outperforms the modular multiplier based on standard bipartite modular multiplication.
Download Now

Find By Topic