Open Problems in Number Theoretic Complexity, II (0)

Cached

Download Links

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

Active Bibliography

1 Cryptology – Prof Ronald Rivest, L. Rivest
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
87 Discrete Logarithms in Finite Fields and Their Cryptographic Significance – A. M. Odlyzko - 1984
17 An overview of computational complexity – Stephen A. Cook - 1983
on Factoring Polynomials Over Finite Fields: A Survey – Joachim Von, Zur Gathen, Daniel Panario
unknown title – Foreword Whitfield Diffie
Chapter 1—Foundations 1.1 Terminology – Bruce Schneier, Wiley Computer Publishing, John Wiley, Whitfield Diffie
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
4 On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems – Tsz-wo Sze - 2007
7 Public-Key Cryptography – James Nechvatal - 1991
17 Lecture Notes on Cryptography – Shafi Goldwasser, Mihir Bellare - 2001
68 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998
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
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
3 Removing Randomness From Computational Number Theory – Victor Shoup - 1989
28 Computing Frobenius Maps And Factoring Polynomials – Joachim Von Zur Gathen, Victor Shoup - 1992
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999