Victor Shoup

STOC Conference 1997 Conference Paper

Private Information Storage (Extended Abstract)

• Rafail Ostrovsky
• Victor Shoup

STOC Conference 1995 Conference Paper

Subquadratic-time factoring of polynomials over finite fields

• Erich L. Kaltofen
• Victor Shoup

SODA Conference 1993 Conference Paper

Fast Construction of Irreducible Polynomials over Finite Fields

• Victor Shoup

STOC Conference 1992 Conference Paper

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)

• Joachim von zur Gathen
• Victor Shoup

STOC Conference 1991 Conference Paper

Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis

• Johannes A. Buchmann
• Victor Shoup

FOCS Conference 1991 Conference Paper

Lower Bounds for Polynomial Evaluation and Interpolation Problems

• Victor Shoup
• Roman Smolensky

It is shown that there is a set of points p/sub 1/, p/sub 2/, .. ., p/sub n/ such that any algebraic program of depth d for polynomial evaluation (or interpolation) at these points has size Omega (n log n/log d). Moreover, if d is a constant, then a lower bound of Omega (n/sup 1+1/d/) is obtained. >

STOC Conference 1990 Conference Paper

Searching for Primitive Roots in Finite Fields

• Victor Shoup

FOCS Conference 1988 Conference Paper

New Algorithms for Finding Irreducible Polynomials over Finite Fields

• Victor Shoup

An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of factoring polynomials over the prime field of K. >