QR Kod

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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Yazar: M. Repka
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: Wiley 2016-04-01
Seri Bilgileri:Electronics Letters
Konular:
Online Erişim:https://doi.org/10.1049/el.2015.4141
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!