Families of irreducible polynomials over Fp, p odd are provided, where pth roots can be efficiently computed. Efficient cube root computations in extensions of characteristic 3 have been recently studied, in part motivated by pairing cryptography implementations. For the particular case p = 3, some previous results are slightly improved and new extensions are provided where efficient cube root computations are possible.

Additional Metadata
Persistent URL dx.doi.org/10.1049/el.2015.3091
Journal Electronics Letters
Citation
Perin, L.P., Custódio, R., Panario, D, & Wang, Q. (2016). Formulas for pth root computations in finite fields of characteristic p. Electronics Letters, 52(2), 117–119. doi:10.1049/el.2015.3091