Loading...
Please wait, while we are loading the content...
Similar Documents
Speeding up bipartite modular multiplication.
| Content Provider | CiteSeerX |
|---|---|
| Author | Vercauteren, Frederik Verbauwhede, Ingrid |
| Abstract | 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. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Bipartite Modular Multiplication Modular Multiplier Rsa Cryptosystems Public-key Cryptosystems Elliptic Curve Cryptography Large Set Hardware Architecture Art Attack Standard Solution Standard Bipartite Modular Multiplication |
| Content Type | Text |
| Resource Type | Article |
