@inproceedings{IACR:conf/crypto2004/MayC04, author = { Alexander May }, title = {Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, booktitle = {CRYPTO}, year = {2004}, pages = {213-219}, ee = {http://www.iacr.org/archive/crypto2004/31520213/det.pdf}, crossref = {IACR:conf/crypto2004}, bibsource = {IACR, http://www.iacr.org} } @proceedings{IACR:conf/crypto2004, editor = {Matthew K. Franklin}, title = {Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings. }, booktitle = {CRYPTO}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3152}, year = {2004}, isbn = {3-540-22668-0}, bibsource = {IACR, http://www.iacr.org} }