I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known ...

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