Arithmetic circuit complexity investigates the computational resources required to evaluate polynomial functions via networks of arithmetic operations. At its core, this field seeks to classify ...

An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over ...

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

Joseph Silverman is a world-leading mathematician working in the general area of Number Theory, and more specifically in Diophantine and arithmetic geometry, elliptic curves and cryptography. Joseph ...

An introduction to basic algebraic structures common throughout mathematics. These may include the integers and their arithmetic, modular arithmetic, rings, polynomial rings, ideals, quotient rings, ...