On The Oracle Complexity Of Factoring Integers (1996)

Cached

Download Links

by Ueli M. Maurer
Venue:COMPUTATIONAL COMPLEXITY
Citations:4 - 0 self

Active Bibliography

39 Parallel Algorithms for Integer Factorisation – Richard P. Brent
24 The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms – Ueli M. Maurer , Stefan Wolf - 1998
23 The Diffie-Hellman Protocol – Ueli M. Maurer, Stefan Wolf - 1999
10 Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey – Alexander May - 2007
17 Factorization of the tenth and eleventh Fermat numbers – Richard P. Brent - 1996
17 Recent progress and prospects for integer factorisation algorithms – Richard P. Brent - 2000
Cryptanalysis of Koyama Scheme – Sahdeo Padhye - 2006
2 Integer Factoring – Arjen K. Lenstra - 2000
Codes -- The Guide to Secrecy . . . – Richard A. Mollin
38 New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n – Kenji Koyama, Ueli M Maurer, Tatsuaki Okamoto, Scott A Vanstone - 1991
61 Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms – Ueli M. Maurer - 1994
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
99 Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes – Jan Camenisch, Markus Michels - 1998
A New Special-Purpose Factorization Algorithm – Qi Cheng
7 Automorphisms of Finite Rings and Applications to Complexity of Problems – Manindra Agrawal, Nitin Saxena - 2005
134 Using Secure Coprocessors – Bennet Yee - 1994
Algorithms for Factoring Integers – Johannes Buchmann, Volker Müller
2 On using Carmichael numbers for public key encryption systems – R.G.E. Pinch - 1997
2 Cryptography in Subgroups of Z*_n – Jens Groth - 2005