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