Abstract
We present an algorithm to compute rth roots in \(\mathbb{F}_{q^m}\) with complexity Õ[(log m + r log q) m log q] if (m,q) = 1 and either (q(q−1),r) = 1 or r|(q−1) and ((q−1)/r,r) = 1. This compares well to previously known algorithms, which need O(r m3 log3 q) steps.
Similar content being viewed by others
References
L. M. Adleman, K. Manders and G. Miller, On taking roots in finite fields, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, (1977) pp. 175–177.
E. Bach J. Shallit (1966) Algorithmic Number Theory NumberInSeriesVol. 1 MIT Press Cambridge, MA
P. S. L. M. Barreto H. Y. Kim B. Lynn M. Scott (2002) ArticleTitle‘Efficient algorithms for pairing-based cryptosystems Advances in Cryptology – Crypto’2002 2442 354–368 Occurrence Handle2004m:94031
D. Boneh M. Franklin (2003) ArticleTitleIdentity-based encryption from the Weil pairing SIAM Journal of Computing 32 IssueID3 586–615 Occurrence Handle10.1137/S0097539701398521 Occurrence Handle2004m:94035
D. Boneh B. Lynn H. Shacham (2002) ArticleTitleShort signatures from the Weil pairing Advances in Cryptology – Asiacrypt’2001 2248 514–532 Occurrence Handle2004a:94051
A. Brauer, On addition chains, Bulletin of the AMS Vol. 45 (1939) pp. 736–739.
S. Galbraith S. Paulus N. Smart (2002) ArticleTitleArithmetic on superelliptic curves Mathematics of Computation 71 393–405 Occurrence Handle10.1090/S0025-5718-00-01297-7 Occurrence Handle2002h:14102
S. Gao J. zur Gathen Particlevon D. Panario V. Shoup (2000) ArticleTitleAlgorithms for exponentiation in finite fields Journal of Symbolic Computation 29 879–889 Occurrence Handle10.1006/jsco.1999.0309 Occurrence Handle2002e:68152a
J. Guajardo C. Paar (2002) ArticleTitleItoh-Tsujii inversion in standard basis and its application in cryptography and codes Designs, Codes and Cryptography 25 207–216 Occurrence Handle10.1023/A:1013860532636 Occurrence Handle2003f:94110
T. Itoh S. Tsujii (1988) ArticleTitleA fast algorithm for computing multiplicative inverses in GF(2m) using normal bases Information and Computation 78 171–177 Occurrence Handle10.1016/0890-5401(88)90024-7 Occurrence Handle89j:11121
B. Libert and J.-J. Quisquater, New identity based signcryption schemes based on pairings, Proc. of 2003 IEEE Information Theory Workshop, Paris, France (2003).
N. P. Smart (2002) ArticleTitleAn identity based authenticated key agreement protocol based on the weil pairing Electronics Letters 38 630–632 Occurrence Handle10.1049/el:20020387
J. von zur Gathen and M. Noecker, Computing special powers in finite fields, Mathematics of Computation. Article electronically published on September 26 (2003); see http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-03-01599-0.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: S. Gao
Paulo S. L. M. Barreto: Supported by Scopus Tecnologia S. A.
José Felipe Voloch: Supported by NSA grant MDA904-03-1-0117.
Rights and permissions
About this article
Cite this article
Barreto, P.S.L.M., Voloch, J.F. Efficient Computation of Roots in Finite Fields. Des Codes Crypt 39, 275–280 (2006). https://doi.org/10.1007/s10623-005-4017-5
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-4017-5