Abstract
The multiplication over finite fields is the most basic and important arithmetic operation. In this paper, we propose a low-latency radix-4 multiplication algorithm based shifted polynomial basis (SPB) over finite fields. The existing multiplication algorithm using SPB has the critical path delay of one 2-input AND gate, one 2-input XOR gate, and one 1-bit latch, and the latency of about 0.5 m clock cycles. Our proposed radix-4 multiplication algorithm has the critical path delay of two 2-input AND gate, two 2-input XOR gate, and one 1-bit latch, and the latency of 0.25 m clock cycles. Our radix-4 multiplication algorithm saves about 20% time complexity as compared to the existing multiplication algorithm based on SPB. Therefore, we expect that the proposed algorithm can lead to a hardware architecture which has a considerably low latency. The multiplier applying the proposed algorithm will be a highly modular architecture and be thus well suited for VLSI implementations.
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 subscriptionsReferences
Peterson, W.W., Weldon, E.J.: Errorcorrecting Codes. MIT Press, Cambridge (1972)
Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)
Schneier, B.: Applied Cryptography, 2nd edn. Wiley, Hoboken (1996)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Huang, W.T., Chang, C.H., Chiou, C.W., Chou, F.H.: Concurrent error detection and correction in a polynomial basis multiplier over \(GF(2^{m})\). IET Inf. Secur. 4, 111–124 (2010)
Kim, K.W., Kim, S.H.: A low latency semi-systolic multiplier over \(GF(2^{m})\). IEICE Electron. Express 10, 20130354 (2013)
Kim, K.W., Jeon, J.C.: A semi-systolic Montgomery multiplier over \(GF(2^{m})\). IEICE Electron. Express 12, 20150769 (2015)
Hariri, A., Reyhani-Masoleh, A.: Digit-level semi-systolic and systolic structures for the shifted polynomial basis multiplication over binary extension fields. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 19, 2125–2129 (2011)
Fan, H., Dai, Y.: Fast bit-parallel \(GF(2^{n})\) multiplier for all trinomials. IEEE Trans. Comput. 54(4), 485–490 (2005)
Fan, H., Hasan, M.: Fast bit parallel shifted polynomial basis multipliers in \(GF(2^{m})\). IEEE Trans. Circ. Syst. I Fundam. Theory Appl. 53, 2606–2615 (2006)
Park, S.M., Chang, K.Y.: Low complexity bit-parallel squarer for \(GF(2^{m})\) defined by irreducible trinomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89, 2451–2452 (2006)
Fan, H., Hasan, M.: A new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Trans. Comput. 56, 224–233 (2007)
Park, S.M., Chang, K.Y., Hong, D.: Efficient bit-parallel multiplier for irreducible pentanomials using a shifted polynomial basis. IEEE Trans. Comput. 55, 1211–1215 (2006)
Negre, C.: Efficient parallel multiplier in shifted polynomial basis. J. Syst. Archit. 53, 109–116 (2007)
Acknowledgments
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2015R1D1A1A01059739).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kim, KW., Lee, HH., Kim, SH. (2017). Low-Latency Radix-4 Multiplication Algorithm over Finite Fields. In: Dang, T., Wagner, R., Küng, J., Thoai, N., Takizawa, M., Neuhold, E. (eds) Future Data and Security Engineering. FDSE 2017. Lecture Notes in Computer Science(), vol 10646. Springer, Cham. https://doi.org/10.1007/978-3-319-70004-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-70004-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70003-8
Online ISBN: 978-3-319-70004-5
eBook Packages: Computer ScienceComputer Science (R0)