%0 Electronic Article
%A M. Repka
%+ Department of Applied Informatics and Information Technology, Institute of Computer Science and Mathematics, FEI STU, Ilkovičova 3, Bratislava SK-812 19, Slovak Republic
%K reduction polynomial
%K extended finite fields
%K pth root computation
%K squaring matrix inversion
%K prime characteristics
%K irreducible polynomial
%X 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.
%@ 0013-5194
%T Computing *p*th roots in extended finite fields of prime characteristic *p* ≥ 2
%B Electronics Letters
%D April 2016
%V 52
%N 9
%P 718-719
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=3demvg78uo45.x-iet-live-01content/journals/10.1049/el.2015.4141
%G EN