Abstract
In this study, we present an efficient finite field arithmetic algorithm for multiplication which is a core algorithm for division and exponentiation operations. In order to obtain a dedicated pipelined algorithm, we adopt Montgomery algorithm and cellular systolic array. First of all, we select an effective Montgomery factor for the design of our parallel algorithm, then we induce an efficient multiplication algorithm from the typical binary MM algorithm using the factor. In this paper, we show the detail derivation process in order to obtain the recursive equations for pipelined computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hariri, A., Reyhani-Masoleh, A.: Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields. IEEE Trans. Computers 60(9), 1341–1353 (2011)
Jeon, J.C., Yoo, K.Y.: Montgomery exponent architecture based on programmable cellular automata. Mathematics and Computers in Simulation 79, 1189–1196 (2008)
Montgomery, P.: Modular Multiplication without Trial Division. Mathematics of Computation 44(170), 519–521 (1985)
Koc, C., Acar, T.: Montgomery Multiplication in GF(2k). Designs, Codes and Cryptography 14(1), 57–69 (1998)
Lee, C.Y., Horng, J.S., Jou, I.C., Lu, E.H.: Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2m). IEEE Transactions on Computers 54(9), 1061–1070 (2005)
Hariri, A., Reyhani-Masoleh, A.: Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields. IEEE Trans. Computers 60(9), 1341–1353 (2011)
Huang, W.T., Chang, C.H., Chiou, C.W., Chou, F.H.: Concurrent error detection and correction in a polynomial basis multiplier over GF(2m). IET Information Security 4(3), 111–124 (2010)
Kim, K.W., Jeon, J.C.: Finite Field Arithmetic Architecture Based on Cellular Array. Int’l Journal of Cyber-Security and Digital Forensics 1(2), 122–129 (2012)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge Univ. Press (1986)
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
Kim, KW., Jeon, JC. (2013). Design of Parallel Pipelined Algorithm for Field Arithmetic Architecture Based on Cellular Array. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_107
Download citation
DOI: https://doi.org/10.1007/978-3-642-38027-3_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38026-6
Online ISBN: 978-3-642-38027-3
eBook Packages: Computer ScienceComputer Science (R0)