Abstract
A square root (SQRT) algorithm in GF(p m) (m = r 0 r 1⋯r n − − 1 2d, r i : odd prime, d > 0: integer) is proposed in this paper. First, the Tonelli-Shanks algorithm is modified to compute the inverse SQRT in \(GF(p^{2^d})\), where most of the computations are performed in the corresponding subfields \(GF{(p^{2^{i}})}\) for 0 ≤i ≤d–1. Then the Frobenius mappings with an addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field GF(p m) are also reduce to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. More specifically the Tonelli-Shanks algorithm and the proposed algorithm in GF(p 22), GF(p 44) and GF(p 88) were implemented on a Pentium4 (2.6 GHz) computer using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerates the SQRT computation by 25 times in GF(p 22), by 45 times in GF(p 44), and by 70 times in GF(p 88), compared to the Tonelli-Shanks algorithm, which is supported by the evaluation of the number of computations.
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
Preview
Unable to display preview. Download preview PDF.
References
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2003)
Kurosawa, K., Ito, T., Takeuchi, M.: Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number. Cryptologia 12(4), 225–233 (1988)
Tonelli, A.: Bemerkung über die Auflösung quadratischer Congruenzen, Göttinger Nachrichten, 344–346 (1891)
Cipolla, M.: Un metodo per la risolutione della congruenza di secondo grado. Rendiconto dell Accademia Scienze Fisiche e Matematiche Napoli, Ser. 3 IX, 154–163 (1903)
Wang, F., Nogami, Y., Morikawa, Y.: An efficient square root computation in finite fields. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(10), 2792–2799 (2005)
Wang, F., Nogami, Y., Morikawa, Y.: A fast square root computation using the Frobenius mapping. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 1–10. Springer, Heidelberg (2003)
Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: Proc. Crypto. 1998, pp. 472–485 (1998)
Nogami, Y., Saito, A., Morikawa, Y.: Finite extension field with modulus of all-one polynomial and representation of its elements for fast arithmetic operations. Trans. IEICE E86-A(9), 2376–2387 (2003)
Fan, J.L., Paar, C.: On efficient inversion in tower fields of characteristic two. In: Proc. ISIT 1997, p. 20 (1997)
Bailey, D.V.: Computation in optimal extension fields, A thesis submitted to the Faculty of the Worcester Polytechnic Institute in partial fulfillment of the requirements for the Degree of Master of Science in Computer Science (2000)
Wang, F.: Efficient square root algorithms over extension fields GF(pm), A thesis submitted to the Graduate School of Natural Science and Technology of Okayama University for the Degree of Doctor in Engineer (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katou, H., Wang, F., Nogami, Y., Morikawa, Y. (2006). A High-Speed Square Root Algorithm in Extension Fields. In: Rhee, M.S., Lee, B. (eds) Information Security and Cryptology – ICISC 2006. ICISC 2006. Lecture Notes in Computer Science, vol 4296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11927587_10
Download citation
DOI: https://doi.org/10.1007/11927587_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49112-5
Online ISBN: 978-3-540-49114-9
eBook Packages: Computer ScienceComputer Science (R0)