Open Problems in Number Theoretic Complexity, II (0)

Cached

Download Links

by Leonard M. Adleman , Kevin S. Mccurley
Citations:25 - 0 self

Active Bibliography

164 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
73 Discrete Logarithms in Finite Fields and Their Cryptographic Significance – A. M. Odlyzko - 1984
16 An overview of computational complexity – Stephen A. Cook - 1983
Chapter 1—Foundations 1.1 Terminology – Bruce Schneier, Wiley Computer Publishing, John Wiley, Whitfield Diffie
33 Algorithms in algebraic number theory – H. W. Lenstra - 1992
3 On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems – Tsz-wo Sze - 2007
138 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
14 Polynomial Factorization 1982-1986 – Erich Kaltofen
6 Public-Key Cryptography – James Nechvatal - 1991
56 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998
7 Normal Bases over Finite Fields – Shuhong Gao - 1993
1 Polynomial-Time Factorization Of Multivariate Polynomials Over Finite Fields – J. von zur Gathen, E. Kaltofen - 1985
3 Arithmetic and factorization of polynomials over F_2 – Joachim von zur Gathen, Jürgen Gerhard - 1996
3 Removing Randomness From Computational Number Theory – Victor Shoup - 1989
23 Computing Frobenius Maps And Factoring Polynomials – Joachim Von Zur Gathen, Victor Shoup - 1992
23 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
8 On the Deterministic Complexity of Factoring Polynomials – Shuhong Gao - 1999
7 Deterministic Irreducibility Testing of Polynomials over Large Finite Fields – Erich Kaltofen - 1987