The basic facts about separable extensions of discrete fields and factoring polynomials are developed in the constructive spirit of Errett Bishop. The ability to factor polynomials is shown to be ...

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

In 2015, the poet-turned-mathematician June Huh helped solve a problem posed about 50 years earlier. The problem was about complex mathematical objects called “matroids” and combinations of points and ...

Digital security depends on the difficulty of factoring large numbers. A new proof shows why one method for breaking digital encryption won’t work. My recent story for Quanta explained a newly proved ...