Abstract
Finite field towers GF(qP) are considered, where P=pn11Pn22··· pntt and all primes pi are distinct factors of (q – 1). Under this condition irreducible binomials of the form xP – c can be used for recursive extension of finite fields. We give description of an infinite sequence of irreducible binomials, new effective algorithms for fast multiplication and inversion in the tower, and finite and asymptotic estimates of arithmetic complexity. It is important that the achievable asymptotic estimate of the complexity has the form O(logQlogξlogQ), Q=qP, where log2γ≥ξ≥1 and γ is the minimal factor of q–1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
