access icon free Computing pth roots in extended finite fields of prime characteristic p ≥ 2

Direct computation of pth roots in extended finite fields of characteristic p ≥ 2 is introduced, wherein the reduction polynomial is irreducible and can be even random. Proposed method works in any case of p ≥ 2 and finite field extension. This method is the most efficient, it is even more efficient than the method, which is widely used, based on inversion of squaring matrix utilised in the case of p = 2. This method is more efficient regarding the computation and storing of the matrix as well as the computation of the roots.

Inspec keywords: Galois fields; polynomials; matrix inversion

Other keywords: reduction polynomial; extended finite fields; pth root computation; squaring matrix inversion; prime characteristics; irreducible polynomial

Subjects: Algebra; Information theory; Information theory; Algebra

http://iet.metastore.ingenta.com/content/journals/10.1049/el.2015.4141
Loading

Related content

content/journals/10.1049/el.2015.4141
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading