## Fast Implementations of RSA Cryptography

### Download From

IEEE### Download Links

- [www.di.ens.fr]
- [gatekeeper.dec.com]
- [pam.devinci.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 82 - 6 self |

### BibTeX

@MISC{Shand_fastimplementations,

author = {M. Shand and et al.},

title = {Fast Implementations of RSA Cryptography},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography � chinese remainders � star chains� Hensel's odd division �a.k.a. Montgomery modular reduction� � carry�save representation � quotient pipelining and asynchronous carry completion adders. A PAM 1 implementation of RSA which combines all of the techniques presented here is fully operational at PRL � it delivers an RSA secret decryption rate over 600Kb�s for 512b keys � and 165Kb�s for 1Kb keys. This is an order of magnitude faster than any previously reported running implementation. While our implementation makes full use of the PAM�s reconfigurability � we can nevertheless derive