Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...
Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer (Jul., 1993), pp. 131-149 (19 pages) ...
Vesselin Dimitrov’s proof of the Schinzel-Zassenhaus conjecture quantifies the way special values of polynomials push each other apart. In the physical world, objects often push each other apart in an ...
Number theoretic transform (NTT) is widely recognized as the most efficient method for computing polynomial multiplication with high dimension and integral coefficients, due to its quasilinear ...
In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's p – 1 algorithm, which finds in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results