{"doi":"10.1007/978-3-540-28628-8_13","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:23:43Z","status":"public","user_id":"25078","year":"2004","author":[{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"}],"department":[{"_id":"64"}],"publication_identifier":{"isbn":["9783540226680","9783540286288"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","publisher":"Springer Berlin Heidelberg","_id":"3015","title":"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring","publication":"Advances in Cryptology – CRYPTO 2004","date_updated":"2022-01-06T06:58:51Z","page":"213-219","type":"book_chapter","citation":{"ama":"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","short":"A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.","chicago":"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.","apa":"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","ieee":"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.","bibtex":"@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} }","mla":"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."}}