An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over $Zp$ is exploited to reduce the ...

Inspired by Rearick's work on logarithm and exponential functions of arithmetic functions, we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving ...

Quadratic equations are polynomials, meaning strings of math terms. An expression like “x + 4” is a polynomial. They can have ...

Polynomial Identity Testing (PIT) is a central problem in this arena, involving the efficient determination of whether a given arithmetic circuit computes the zero polynomial.