{"place":"Berlin, Heidelberg","doi":"10.1007/3-540-44670-2_2","date_created":"2018-06-05T08:26:29Z","status":"public","department":[{"_id":"64"}],"publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"first_name":"Johannes","id":"23","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"}],"user_id":"25078","year":"2007","publication_status":"published","_id":"3020","title":"Low Secret Exponent RSA Revisited","publisher":"Springer Berlin Heidelberg","citation":{"ama":"Blömer J, May A. Low Secret Exponent RSA Revisited. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>","ieee":"J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.","short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.","apa":"Blömer, J., &#38; May, A. (2007). Low Secret Exponent RSA Revisited. In <i>Lecture Notes in Computer Science</i> (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>","chicago":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In <i>Lecture Notes in Computer Science</i>, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret Exponent RSA Revisited}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }","mla":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>."},"type":"book_chapter","page":"4-19","date_updated":"2022-01-06T06:58:51Z","publication":"Lecture Notes in Computer Science"}