A TINY RSA COPROCESSOR BASED ON OPTIMIZED SYSTOLIC MONTGOMERY ARCHITECTURE

Zongbin Liu, Luning Xia, Jiwu Jing, Peng Liu

Abstract

In this paper we propose a new hardware architecture of modular exponentiation, which is based on the optimized Montgomery multiplication. At CHES 1999, Tenca introduced a new architecture for implementing the Montgomery multiplication which was later improved by Huang et al. at PKC 2008. In this paper we improve the architecture of Huang and the improved one occupies less hardware resource, at the same time we add the final subtraction of the Montgomery algorithm into the architecture in order to do the exponentiation computation. Finally we use this improved architecture to build a RSA coprocessor. Compared with the previous work, the new 1024-bit RSA coprocessor saved nearly 50% of area, and the area utilization is greatly improved. This design is the smallest design as we know in the literature, and we verified the correctness by huge test data.

References

  1. Cilardo, A., Mazzeo, A., Romano, L., and Saggese, G. (2004). Carry-save Montgomery modular exponentiation on reconfigurable hardware.
  2. Großchadl, J. (2000). High-Speed RSA Hardware Based on Barrets Modular Reduction Method. In Cryptographic Hardware and Embedded SystemsCHES 2000, pages 95-136. Springer.
  3. Harris, D., Krishnamurthy, R., Anders, M., Mathew, S., and Hsu, S. (2005). An improved unified scalable radix-2 Montgomery multiplier. In Proceedings of the 17th IEEE Symposium on Computer Arithmetic, pages 172-178. Citeseer.
  4. Huang, M., Gaj, K., Kwon, S., and El-Ghazawi, T. (2008). An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm. Lecture Notes in Computer Science, 4939:214.
  5. Kaya-Koc, C. (1995). RSA Hardware Implementation. RSA Data Security, Inc., Version, 1.
  6. McIvor, C. et al. (2004a). FPGA Montgomery multiplier architectures-a comparison.
  7. McIvor, C., McLoone, M., and McCanny, J. (2004b). Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proceedings-Computers and Digital Techniques, 151(6):402-408.
  8. Mclvor, C., McLoone, M., and McCanny, J. (2003). Fast Montgomery modular multiplication and RSA cryptographic processor architectures. In Conference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers, 2003, pages 379-384.
  9. Montgomery, P. (1985). Modular multiplication without trial division. Mathematics of computation, 44(170):519-521.
  10. Shieh, M.-D., Chen, J.-H., Wu, H.-H., and Lin, W.-C. (2008). A new modular exponentiation architecture for efficient design of rsa cryptosystem. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, 16(9):1151 -1161.
  11. Tenca, A. and Koc¸, C¸ . (1999). A scalable architecture for Montgomery multiplication. Lecture Notes in Computer Science, pages 94-108.
Download


Paper Citation


in Harvard Style

Liu Z., Xia L., Jing J. and Liu P. (2011). A TINY RSA COPROCESSOR BASED ON OPTIMIZED SYSTOLIC MONTGOMERY ARCHITECTURE . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011) ISBN 978-989-8425-71-3, pages 105-113. DOI: 10.5220/0003511401050113


in Bibtex Style

@conference{secrypt11,
author={Zongbin Liu and Luning Xia and Jiwu Jing and Peng Liu},
title={A TINY RSA COPROCESSOR BASED ON OPTIMIZED SYSTOLIC MONTGOMERY ARCHITECTURE},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)},
year={2011},
pages={105-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003511401050113},
isbn={978-989-8425-71-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)
TI - A TINY RSA COPROCESSOR BASED ON OPTIMIZED SYSTOLIC MONTGOMERY ARCHITECTURE
SN - 978-989-8425-71-3
AU - Liu Z.
AU - Xia L.
AU - Jing J.
AU - Liu P.
PY - 2011
SP - 105
EP - 113
DO - 10.5220/0003511401050113