Open AccessFormulas for p th root computations in finite fields of characteristic p
Author(s) -
Perin L.P.,
Custódio R.,
Panario D.,
Wang Q.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2015.3091
Subject(s) - cube root , root (linguistics) , computation , finite field , mathematics , cube (algebra) , cryptography , combinatorics , discrete mathematics , algebra over a field , arithmetic , pure mathematics , algorithm , geometry , philosophy , linguistics
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.