International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring

Authors:
Alexander May
Download:
DOI: 10.1007/978-3-540-28628-8_13 (login may be required)
URL: https://iacr.org/archive/crypto2004/31520213/det.pdf
Search ePrint
Search Google
Conference: CRYPTO 2004
BibTeX
@inproceedings{crypto-2004-1092,
  title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring},
  booktitle={Advances in Cryptology - CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3152},
  pages={213-219},
  url={https://iacr.org/archive/crypto2004/31520213/det.pdf},
  doi={10.1007/978-3-540-28628-8_13},
  author={Alexander May},
  year=2004
}