<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>book chapter</genre>

<titleInfo><title>Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Alexander</namePart>
  <namePart type="family">May</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">64</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>









<originInfo><publisher>Springer Berlin Heidelberg</publisher><dateIssued encoding="w3cdtf">2004</dateIssued>
</originInfo>



<relatedItem type="host"><titleInfo><title>Advances in Cryptology – CRYPTO 2004</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="issn">1611-3349</identifier>
  <identifier type="isbn">9783540226680</identifier>
  <identifier type="isbn">9783540286288</identifier><identifier type="doi">10.1007/978-3-540-28628-8_13</identifier>
<part><extent unit="pages">213-219</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: &lt;i&gt;Advances in Cryptology – CRYPTO 2004&lt;/i&gt;. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-540-28628-8_13&quot;&gt;10.1007/978-3-540-28628-8_13&lt;/a&gt;</ama>
<ieee>A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in &lt;i&gt;Advances in Cryptology – CRYPTO 2004&lt;/i&gt;, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.</ieee>
<chicago>May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” In &lt;i&gt;Advances in Cryptology – CRYPTO 2004&lt;/i&gt;, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. &lt;a href=&quot;https://doi.org/10.1007/978-3-540-28628-8_13&quot;&gt;https://doi.org/10.1007/978-3-540-28628-8_13&lt;/a&gt;.</chicago>
<apa>May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In &lt;i&gt;Advances in Cryptology – CRYPTO 2004&lt;/i&gt; (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. &lt;a href=&quot;https://doi.org/10.1007/978-3-540-28628-8_13&quot;&gt;https://doi.org/10.1007/978-3-540-28628-8_13&lt;/a&gt;</apa>
<bibtex>@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={&lt;a href=&quot;https://doi.org/10.1007/978-3-540-28628-8_13&quot;&gt;10.1007/978-3-540-28628-8_13&lt;/a&gt;}, booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={213–219} }</bibtex>
<mla>May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” &lt;i&gt;Advances in Cryptology – CRYPTO 2004&lt;/i&gt;, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-540-28628-8_13&quot;&gt;10.1007/978-3-540-28628-8_13&lt;/a&gt;.</mla>
<short>A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>3015</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-06-05T08:23:43Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-01-06T06:58:51Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
