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

A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.

Download
No fulltext has been uploaded.
Book Chapter | Published
Author
Publishing Year
Book Title
Advances in Cryptology – CRYPTO 2004
Page
213-219
LibreCat-ID

Cite this

May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13
@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={10.1007/978-3-540-28628-8_13}, booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={213–219} }
May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-28628-8_13.
A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.
May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:10.1007/978-3-540-28628-8_13.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search