Constructing nonresidues in finite fields and the extended Riemann hypothesis (1991)

Cached

Download Links

by Johannes Buchmann , Victor Shoup
Venue:Math. Comp
Citations:8 - 0 self

Active Bibliography

40 Searching for Primitive Roots in Finite Fields – Victor Shoup - 1992
68 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998
3 Removing Randomness From Computational Number Theory – Victor Shoup - 1989
17 Explicit bounds for primes in residue classes – Eric Bach, Jonathan Sorenson - 1996
9 Normal Bases over Finite Fields – Shuhong Gao - 1993
Trading GRH for Algebra: Algorithms for Factoring Polynomials and Related Structures – Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena - 811
9 On the Deterministic Complexity of Factoring Polynomials – Shuhong Gao - 1999
7 Computing Arakelov class groups – Rene Schoof - 2008
CONTENTS – unknown authors
on Factoring Polynomials Over Finite Fields: A Survey – Joachim Von, Zur Gathen, Daniel Panario
1 Approximate Constructions In Finite Fields – Igor Shparlinski
GENERATORS OF ELLIPTIC CURVES OVER FINITE – Igor E. Shparlinski, José, Felipe Voloch
107 Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator – Ronen Shaltiel, Christopher Umans - 2001
Schemes for Deterministic Polynomial Factoring – Gábor Ivanyos, Marek Karpinski, Nitin Saxena - 2008
26 Open Problems in Number Theoretic Complexity, II – Leonard M. Adleman, Kevin S. Mccurley
Using the smoothness of p − 1 for computing roots modulo p – Bartosz Zralek - 2008
8 Fast computation with two algebraic numbers – Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost - 2002
20 Fast Computation of Special Resultants – Alin Bostan , Philippe Flajolet, Bruno Salvy, Éric Schost - 2006
4 Efficiently constructible huge graphs that preserve first order properties of random graphs – Moni Naor, Asaf Nussboim, Eran Tromer - 2005