Abstract
The objective of this paper is to give a fast square root computation method. First the Frobenius mapping is adopted. Then a lot of calculations over an extension field are reduced to that over a proper subfield by the norm computation. In addition a inverse square root algorithm and an addition chain are adopted to save the computation cost. All of the above-mentioned steps have been proven to make the proposed algorithm much faster than the conventional algorithm. From the table which compares the computation between the conventional and the proposed algorithm, it is clearly shown that the proposed algorithm accelerates the square root computation 10 times and 20 times faster than the conventional algorithm in F p 11 and F p 12 respectively. At the same time, the proposed algorithm reduces the computation cost 10 times and 20 times less than the conventional algorithm.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. LNS, vol. 265. Cambridge University Press, Cambridge (1999)
Guajardo, J., Blumel, R., Kritieger, U., Paar, C.: Efficient Implementation of Elliptic Curve Cryptosystems on the TI MSP430x33x Family of Microcontrollers. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 365–382. Springer, Heidelberg (2001)
Sato, T., Araki, K.: Fermat Quotients and the Polynomial Time Discrete Lot Algorithm for Anomalous Elliptic Curve. Commentarii Math. Univ. Sancti. Pauli. 47(1), 81–92 (1998)
Menezes, A., Okamoto, T., Vanstone, S.: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Trans. 39, 1639–1646 (1993)
Frey, G., Rück, H.: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves. Math. Comp. 62, 865–874 (1994)
Gaudry, P., Hess, F., Smart, N.: Constructive and destructive facets of Weil descent on elliptic curves. Hewlett Packard Lab. Technical Report, HPL-2000-10 (2000)
Bailey, D.B., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public- Key Algorithms. In: Proc. Asiacrypt 2000. LNCS, vol. 1976, pp. 248–258 (2000)
Nogami, Y., Saito, A., Morikawa, Y.: Finite Extension Field with Modulus of All- One Polynomial and Expression of Its Elements for Fast Arithmetic Operations. In: Proc. of The International Conference on Fudamentals of Electronics, Communications and Computer Sciences (ICFS 2002), R-18, pp. 10–15 (2002)
Kobayashi, T., Aoki, K., Hoshino, F.: OEF Using a Successive Extension. In: Proc. The 2000 Symposium on Cryptography and Information Security, vol. (B02) (2000) (in Japanese)
Nogami, Y., Fujii, Y., Morikawa, Y.: The Cost of Operations in Tower Field. In: The 2002 Symposium on Cryptography and Information Security, vol. 2, pp. 693–698 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, W., Nogami, Y., Morikawa, Y. (2003). A Fast Square Root Computation Using the Frobenius Mapping. In: Qing, S., Gollmann, D., Zhou, J. (eds) Information and Communications Security. ICICS 2003. Lecture Notes in Computer Science, vol 2836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39927-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-39927-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20150-2
Online ISBN: 978-3-540-39927-8
eBook Packages: Springer Book Archive