We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...