Abstract
For big data security, high-speed arithmetic units are needed. Finite field arithmetic has received much attention in error-control codes, cryptography, etc. The modular exponentiation over finite fields is an important and essential cryptographic operation. The modular exponentiation can be performed by a sequence of modular squaring and multiplication based on the binary method. In this paper, we propose a combined algorithm to concurrently perform multiplication and squaring over \(GF(2^{m})\) using the bipartite method and common operations. We expect that the architecture based on the proposed algorithm can reduce almost a half of latency compared to the existing architecture. Therefore, we expect that our algorithm can be efficiently used for various applications including big data security which demands high-speed computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)
Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Scott, P.A., Simmons, S.J., Tavares, S.E., Peppard, L.E.: Architectures for exponentiation in \(GF(2^{m})\). IEEE J. Sel. Areas Commun. 6, 578–585 (1988)
Lee, K.J., Yoo, K.Y.: Linear systolic multiplier/squarer for fast exponentiation. Inf. Process. Lett. 76, 105–111 (2000)
Ha, J.C., Moon, S.J.: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. Inf. Process. Lett. 66, 105–107 (1998)
Choi, S.H., Lee, K.J.: Efficient systolic modular multiplier/squarer for fast exponentiation over \(GF(2^{m})\). IEICE Electron. Express 12, 20150222 (2015)
Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. II. Addison-Wesley, Reading, MA (1997)
Kim, K.W., Jeon, J.C.: Polynomial basis multiplier using cellular systolic architecture. IETE J. Res. 60, 194–199 (2014)
Kim, K.W., Jeon, J.C.: A semi-systolic Montgomery multiplier over \(GF(2^{m})\). IEICE Electron. Express 12, 20150769 (2015)
Kaihara, M.E., Takagi, N.: Bipartite modular multiplication. In: CHES 2005, vol. 3659, pp. 201–210 (2005)
Kaihara, M.E., Takagi, N.: Bipartite modular multiplication method. IEEE Trans. Comput. 57, 157–164 (2008)
Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44, 519–521 (1985)
Koc, C., Acar, T.: Montgomery multiplication in \(GF(2^{k})\). Des. Codes Cryptogr. 14, 57–69 (1998)
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
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kim, KW., Lee, HH., Kim, SH. (2018). Efficient Combined Algorithm for Multiplication and Squaring for Fast Exponentiation over Finite Fields \(GF(2^{m})\) . In: Lee, W., Choi, W., Jung, S., Song, M. (eds) Proceedings of the 7th International Conference on Emerging Databases. Lecture Notes in Electrical Engineering, vol 461. Springer, Singapore. https://doi.org/10.1007/978-981-10-6520-0_6
Download citation
DOI: https://doi.org/10.1007/978-981-10-6520-0_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6519-4
Online ISBN: 978-981-10-6520-0
eBook Packages: EngineeringEngineering (R0)