Abstract
This paper proposes a unified and programmable crypto-processor with coarse-grained reconfigurable datapath to perform either RSA or elliptic curve cryptosystems (ECC) over prime field GF(p), which uses Residue Number System (RNS) as basic arithmetic to exploit data-level parallelism and Transport Triggered Architecture to improve instruction-level parallelism. The reconfigurable datapath provides three configuration modes to accelerate the RNS Montgomery multiplication(RNSMM). An efficient RNS base, 2n − ci, is chosen to reduce the multiplication complexity of RNSMM. Experimental results show that the proposed processor has better tradeoff among algorithm flexibility, performance and area than other related works.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hutter, M., Wenger, E.: Fast Multi-precision Multiplication for Public-key Cryptography on Embedded Microprocessors. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 459–474. Springer, Heidelberg (2011)
Zeng, X.-Y., et al.: A Reconfigurable Public-key Cryptography Coprocessor. In: IEEE Asia-Pacific Conf. on Advanced System Integrated Circuits (AP-ASIC 2004), pp. 172–175 (2004)
Mentens, N., Sakiyama, K., et al.: A Side-channel Attack Resistant Programmable PKC Coprocessor for Embedded Applications. In: Int. Conf. on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS-7), pp. 194–200 (2007)
Chen, J.-H., Shieh, M.-D., et al.: A High-performance Unified-field Reconfigurable Cryptographic Processor. IEEE Tran. VLSI. 18(8), 1145–1158 (2010)
Smyth, N., et al.: An Adaptable and Scalable Asymmetric Cryptographic Processor. In: IEEE Int. Conf. on Application-Specific Systems, Architectures and Processors (ASAP-17), pp. 341–346 (2006)
Wang, Z., Fan, S.-Q.: Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2m). IEEE Tran. Comp. 61(3), 415–419 (2012)
Huang, M.-Q., Gaj, K., et al.: New Hardware Architectures for Montgomery Modular Multiplication Algorithm. IEEE Tran. Comp. 60(7), 923–936 (2011)
Kawamura, S.-i., Koike, M., Sano, F., Shimbo, A.: Cox-rower architecture for fast parallel montgomery multiplication. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 523–538. Springer, Heidelberg (2000)
Schinianakis, D.M., et al.: An RNS Implementation of an Fp Elliptic Curve Point Multiplier. IEEE Tran. Circ. Syst. 56(6), 1202–1213 (2009)
Guillermin, N.: A high speed coprocessor for elliptic curve scalar multiplications over \({\mathbb{F}_p}\). In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 48–64. Springer, Heidelberg (2010)
Schinianakis, et al.: A RNS Montgomery Multiplication Architecture. In: IEEE Int. Symp. on Circuits and Systems (ISCAS), pp.1167–1170 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, J., Guo, W., Liu, H., Tan, Y. (2013). A Unified Cryptographic Processor for RSA and ECC in RNS. In: Xu, W., Xiao, L., Zhang, C., Li, J., Yu, L. (eds) Computer Engineering and Technology. NCCET 2013. Communications in Computer and Information Science, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41635-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-41635-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41634-7
Online ISBN: 978-3-642-41635-4
eBook Packages: Computer ScienceComputer Science (R0)