|
30
|
Searching for Primitive Roots in Finite Fields
– Victor Shoup
- 1992
|
|
3
|
Removing Randomness From Computational Number Theory
– Victor Shoup
- 1989
|
|
14
|
Explicit bounds for primes in residue classes
– Eric Bach, Jonathan Sorenson
- 1996
|
|
56
|
Subquadratic-time factoring of polynomials over finite fields
– Erich Kaltofen, Victor Shoup
- 1998
|
|
7
|
Normal Bases over Finite Fields
– Shuhong Gao
- 1993
|
|
8
|
On the Deterministic Complexity of Factoring Polynomials
– Shuhong Gao
- 1999
|
|
9
|
Comments on search procedures for primitive roots
– Eric Bach
- 1997
|
|
2
|
Computing Arakelov class groups
– Rene Schoof
- 2008
|
|
83
|
A COMPUTATIONAL INTRODUCTION TO NUMBER THEORY AND ALGEBRA
– Victor Shoup
- 2004
|
|
93
|
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator
– Ronen Shaltiel, Christopher Umans
- 2001
|
|
25
|
Open Problems in Number Theoretic Complexity, II
– Leonard M. Adleman, Kevin S. Mccurley
|
|
|
Trading GRH for Algebra: Algorithms for Factoring Polynomials and Related Structures
– Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
- 811
|
|
17
|
Fast Computation of Special Resultants
– Alin Bostan , et al.
- 2006
|
|
8
|
Fast computation with two algebraic numbers
– Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost
- 2002
|
|
|
A Practical Version of the Generalized Lagrange Algorithm
– Johannes Buchmann, Max Jüntgen, Michael Pohst
- 1994
|
|
4
|
Unit Computation in Purely Cubic Function Fields of Unit Rank 1, to appear
– Renate Scheidler, Andreas Stein
- 1998
|
|
1
|
Under the assumption of the Generalized Riemann Hypothesis verifying the class number belongs to NP ∩ co–NP
– Christoph Thiel
- 1994
|
|
14
|
Voronoi's Algorithm in Purely Cubic Congruence Function Fields of Unit Rank 1
– R. Scheidler, A. Stein
|
|
12
|
An Analysis of the Reduction Algorithms for Binary Quadratic Forms
– Ingrid Biehl, Johannes Buchmann
- 1997
|
