Formulas for p th root computations in finite fields of characteristic p
Lucas Pandolfo Perin, Ricardo Felipe Custódio, Daniel Panario, Qiang Wang · Electronics Letters · 2015
Families of irreducible polynomials over 𝔽 p , p odd are provided, where p th 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.