Chandan Saha

most citedFactoring Polynomials over Finite Fields using Balance Test

6 citations · 6 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DS2008★ 6 cited

Factoring Polynomials over Finite Fields using Balance Test

Chandan Saha

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time a…

cs.SC2008

Fast Integer Multiplication using Modular Arithmetic

Anindya De, Piyush P Kurur, Chandan Saha +1

We give an $O (N \cdot lo g N \cdot 2^{O (l o g^{*} N)})$ algorithm for multiplying two $N$ -bit integers that improves the $O (N \cdot lo g N \cdot lo g lo g N)$ algorithm by Schönhage-Strasse…