Abstract
Computational demanding public key cryptographic algorithms, such as Rivest-Shamir-Adleman (RSA) and Elliptic Curve (EC) cryptosystems, are critically dependent on modular multiplication for their performance. Modular multiplication used in cryptography may be performed in two different algebraic structures, namely GF(N) and GF(2n), which normally require distinct hardware solutions for speeding up performance. For both fields, Montgomery multiplication is the most widely adopted solution, as it enables efficient hardware implementations, provided that a slightly modified definition of modular multiplication is adopted. In this paper we propose a novel unified architecture for parallel Montgomery multiplication supporting both GF(N) and GF(2n) finite field operations, which are critical for RSA ad ECC public key cryptosystems. The hardware scheme interleaves multiplication and modulo reduction. Furthermore, it relies on a modified Booth recoding scheme for the multiplicand and a radix-4 scheme for the modulus, enabling reduced time delays even for moderately large operand widths. In addition, we present a pipelined architecture based on the parallel blocks previously introduced, enabling very low clock counts and high throughput levels for long operands used in cryptographic applications. Experimental results, based on 0.18 μm CMOS technology, prove the effectiveness of the proposed techniques, and outperform the best results previously presented in the technical literature.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)
Blum, T., Paar, C.: High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware. IEEE Transactions on Computers 50, 759–764 (2001)
Burgess, N.: Removal Of Sign-Extension Circuitry From Booth’s Algorithms Multiplier-Accumulators. Electronics Letters 26, 1413–1415 (1990)
Großschädl, J.: A bit-serial unified multiplier architecture for finite fields GF(p) and GF(2n). In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, p. 202. Springer, Heidelberg (2001)
Großschädl, J., Kamendje, G.A.: Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m). In: Proceedings of the 14th IEEE Int. Conference on Application-specific Systems, Architectures and Processors (ASAP 2003), pp. 455–468. IEEE Computer Society Press, Los Alamitos (2003)
Großschädl, J., Kamendje, G.A.: Low Power Design of a Functional Unit for Arithmetic in Finite Fields GF(p) and GF(2m). In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol. 2908, pp. 227–243. Springer, Heidelberg (2004)
Koç, Ç.K., Acar, T., Kaliski, B.S.: Analyzing and Comparing Montgomery Multiplication Algorithms. IEEE Micro 16, 26–33 (1996)
Koç, Ç.K., Acar, T.: Montgomery Multiplication GF(2n). Designs, Codes and Cryptography 14, 57–69 (1998)
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44, 519–521 (1985)
Örs, S.B., Batina, L., Preneel, B., Vandewalle, J.: Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2003), p. 184b (2003)
Rivest, R.L., Shamir, A., Adleman, L.: A Method for obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21, 120–126 (1978)
Sakiyama, K., Preneel, B., Verbauwhede, I.: A Fast Dual-Field Modular Arithmetic Logic Unit and its Hardware Implementation. In: Proc. IEEE International Symposium on Circuits and Systems (ISCAS 2006), pp. 787–790 (2006)
Satoh, A., Takano, K.: A Scalable Dual-Field Elliptic Curve Cryptographic Processor. IEEE Transanctions on Computers 52, 449–460 (2003)
Savaş, E., Tenca, A.F., Koç, Ç.K.: A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 281–296. Springer, Heidelberg (2000)
Son, H.K., Oh, S.G.: Design and Implementation of Scalable Low-Power Montgomery Multiplier. In: Proceedings of the IEEE International Conference on Computer Design (ICCD 2004), pp. 524–531 (2004)
Tsai, W.C., Shung, C.B., Wang, S.J.: Two systolic architectures for modular multiplication. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 8, 103–107 (2000)
Walter, C.D.: Systolic Modular Multiplication. IEEE Transactions on Computers 42, 376–378 (1993)
Wolkerstorfer, J.: Dual-field arithmetic unit for GF(p) and GF(2m). In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 500–514. Springer, Heidelberg (2003)
Tenca, A.F., Tawalbeh, L.A.: Carry-Save Representation is Shift-Unsafe: The Problem and Its Solution. IEEE Transanctions on Computers 55, 630–635 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Cilardo, A., Mazzocca, N. (2010). Time Efficient Dual-Field Unit for Cryptography-Related Processing. In: Piguet, C., Reis, R., Soudris, D. (eds) VLSI-SoC: Design Methodologies for SoC and SiP. VLSI-SoC 2008. IFIP Advances in Information and Communication Technology, vol 313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12267-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12267-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12266-8
Online ISBN: 978-3-642-12267-5
eBook Packages: Computer ScienceComputer Science (R0)