Speeding Up Bipartite Modular Multiplication

Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks on public-key cryptosystems, we show that the proposed set is safe to use in practice for both elliptic curve cryptography and RSA cryptosystems. We propose a hardware architecture for the modular multiplier that is based on our method. The results show that, concerning the speed, our proposed architecture outperforms the modular multiplier based on standard bipartite modular multiplication. Additionally, our design consumes less area compared to the standard solutions.

• Type: Conference
• Year: 2010
• Where: WAIFI
• Authors: Miroslav Knezevic, Frederik Vercauteren, Ingrid Verbauwhede
• Keywords: Bipartite Modular Multiplication, Elliptic Curve Cryptography, Mathematics, Modular Multiplier, WAIFI 2010