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

Authors: Alexander May | Venue: CRYPTO 2004 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{C:May04,
  author = {Alexander May},
  title = {Computing the {RSA} Secret Key Is Deterministic Polynomial Time Equivalent to Factoring},
  pages = {213--219},
  editor = {Matthew Franklin},
  booktitle = {Advances in Cryptology -- {CRYPTO}~2004},
  volume = {3152},
  series = {Lecture Notes in Computer Science},
  address = {Santa Barbara, CA, USA},
  month = {aug~15--19},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2004},
  doi = {10.1007/978-3-540-28628-8_13},
}