A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper, we present a method to compute all the irreducible and primitive polynomials of degree m over a finite field. We also describe two concrete implementations of our method with respective time complexities O(m 2 + m log rn) and O(m 2 ÷ logm). These implementations, using in parallel different devices introduced to operate in these fields , , allows us to reduce the time complexity of our method below that of the best previously known methods . Our algorithm is especiallydoi:10.1007/3-540-54522-0_123 fatcat:2im7ejbtnfa5lpsrp5ddjfxjxy