BibTeX record conf/crypto/May04

download as .bib file

@inproceedings{DBLP:conf/crypto/May04,
  author       = {Alexander May},
  editor       = {Matthew K. Franklin},
  title        = {Computing the {RSA} Secret Key Is Deterministic Polynomial Time Equivalent
                  to Factoring},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2004, 24th Annual International
                  CryptologyConference, Santa Barbara, California, USA, August 15-19,
                  2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3152},
  pages        = {213--219},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-28628-8\_13},
  doi          = {10.1007/978-3-540-28628-8\_13},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/May04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.