Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...

Mathematics Magazine presents articles and notes on undergraduate mathematical topics in a lively expository style that appeals to students and faculty throughout the undergraduate years. The journal ...

A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...