People tend to obsess over making computer software faster. You can, of course, just crank up the clock speed and add more processors, but often the most powerful way to make something faster is to ...

Multiplication of two numbers is easy, right? At primary school we learn how to do long multiplication like this: Methods similar to this go back thousands of years, at least to the ancient Sumerians ...

Most people know just one way to multiply two large numbers by hand. Typically, they learned it in elementary school. They’re often surprised to find that there are a variety of ways to do ...

When I was 9, my family got a new computer. It was better than our old computer in every way save one: It couldn’t run my favorite racing game. What’s the point of a fancy new computer, I remember ...

Methods similar to this go back thousands of years, at least to the ancient Sumerians and Egyptians. But is this really the best way to multiply two big numbers together? Around 1956, the famous ...

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

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

David Harvey receives funding from the Australian Research Council. Around 1956, the famous Soviet mathematician Andrey Kolmogorov conjectured that this is the best possible way to multiply two ...