[{"has_accepted_license":"1","date_updated":"2023-10-05T16:54:18Z","author":[{"full_name":"Gorski, Michael","first_name":"Michael","last_name":"Gorski"}],"title":"Boomerang- und Rechteckangriff auf AES","year":"2006","status":"public","user_id":"41047","ddc":["000"],"language":[{"iso":"eng"}],"_id":"47691","citation":{"bibtex":"@book{Gorski_2006, title={Boomerang- und Rechteckangriff auf AES}, author={Gorski, Michael}, year={2006} }","ama":"Gorski M. <i>Boomerang- Und Rechteckangriff Auf AES</i>.; 2006.","mla":"Gorski, Michael. <i>Boomerang- Und Rechteckangriff Auf AES</i>. 2006.","chicago":"Gorski, Michael. <i>Boomerang- Und Rechteckangriff Auf AES</i>, 2006.","short":"M. Gorski, Boomerang- Und Rechteckangriff Auf AES, 2006.","ieee":"M. Gorski, <i>Boomerang- und Rechteckangriff auf AES</i>. 2006.","apa":"Gorski, M. (2006). <i>Boomerang- und Rechteckangriff auf AES</i>."},"file_date_updated":"2023-10-05T16:54:18Z","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","keyword":["Diplomarbeit"],"type":"misc","date_created":"2023-10-05T16:35:30Z","file":[{"content_type":"application/pdf","file_id":"47719","date_updated":"2023-10-05T16:54:18Z","relation":"main_file","file_size":4311037,"access_level":"open_access","file_name":"2006_Gorski_BoomerangUndRechteckangriffAufAES.pdf","date_created":"2023-10-05T16:34:54Z","creator":"bhenrik"}]},{"type":"misc","keyword":["Diplomarbeit"],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"file":[{"date_created":"2023-10-05T16:35:17Z","creator":"bhenrik","content_type":"application/pdf","file_id":"47718","access_level":"open_access","file_size":612147,"file_name":"2006_Naewe_SamplemethodenInDerAlgorithmischenGeometrieDerZahlen.pdf","date_updated":"2023-10-05T16:54:10Z","relation":"main_file"}],"place":"Universität Paderborn","date_created":"2023-10-05T16:35:23Z","file_date_updated":"2023-10-05T16:54:10Z","citation":{"mla":"Naewe, Stefanie. <i>Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit</i>. 2006.","ama":"Naewe S. <i>Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit</i>.; 2006.","bibtex":"@book{ Naewe_2006, place={Universität Paderborn}, title={Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit}, author={ Naewe, Stefanie}, year={2006} }","apa":"Naewe, S. (2006). <i>Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit</i>.","ieee":"S.  Naewe, <i>Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit</i>. Universität Paderborn, 2006.","chicago":"Naewe, Stefanie. <i>Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit</i>. Universität Paderborn, 2006.","short":"S.  Naewe, Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit, Universität Paderborn, 2006."},"ddc":["000"],"user_id":"49063","language":[{"iso":"ger"}],"_id":"47692","date_updated":"2024-08-08T12:16:01Z","publication_status":"published","has_accepted_license":"1","title":"Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit","status":"public","year":"2006","author":[{"first_name":"Stefanie","last_name":" Naewe","full_name":" Naewe, Stefanie","id":"1971"}]},{"publisher":"Universität Paderborn","_id":"2913","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20040101308"}],"user_id":"25078","author":[{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"year":"2005","title":"Fault Attacks and Countermeasures","status":"public","date_updated":"2022-01-06T06:58:46Z","date_created":"2018-05-25T10:50:49Z","department":[{"_id":"64"}],"type":"dissertation","citation":{"ieee":"M. Otto, <i>Fault Attacks and Countermeasures</i>. Universität Paderborn, 2005.","apa":"Otto, M. (2005). <i>Fault Attacks and Countermeasures</i>. Universität Paderborn.","chicago":"Otto, Martin. <i>Fault Attacks and Countermeasures</i>. Universität Paderborn, 2005.","short":"M. Otto, Fault Attacks and Countermeasures, Universität Paderborn, 2005.","mla":"Otto, Martin. <i>Fault Attacks and Countermeasures</i>. Universität Paderborn, 2005.","bibtex":"@book{Otto_2005, title={Fault Attacks and Countermeasures}, publisher={Universität Paderborn}, author={Otto, Martin}, year={2005} }","ama":"Otto M. <i>Fault Attacks and Countermeasures</i>. Universität Paderborn; 2005."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}]},{"year":"2005","title":"A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]},"date_updated":"2022-01-06T06:58:50Z","publication_status":"published","series_title":"Lecture Notes in Computer Science","doi":"10.1007/11426639_15","publication":"EUROCRYPT 2005","file":[{"date_created":"2018-06-05T08:18:20Z","creator":"feidens","file_id":"3008","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-06-05T08:18:20Z","file_name":"toolkit.pdf","file_size":333655,"access_level":"closed"}],"date_created":"2018-06-05T08:16:47Z","type":"book_chapter","department":[{"_id":"64"}],"status":"public","has_accepted_license":"1","page":"251-267","_id":"3006","publisher":"Springer Berlin Heidelberg","ddc":["000"],"user_id":"25078","file_date_updated":"2018-06-05T08:18:20Z","citation":{"mla":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>.","ama":"Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: <i>EUROCRYPT 2005</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>","bibtex":"@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }","apa":"Blömer, J., &#38; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In <i>EUROCRYPT 2005</i> (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>","ieee":"J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.","short":"J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.","chicago":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In <i>EUROCRYPT 2005</i>, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>."},"place":"Berlin, Heidelberg"},{"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:19:48Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"EUROCRYPT 2005","citation":{"mla":"Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>.","ama":"Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: <i>EUROCRYPT 2005</i>. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>","bibtex":"@inbook{Ernst_Jochemsz_May_de Weger_2005, place={Berlin, Heidelberg}, series={LNCS}, title={Partial Key Exposure Attacks on RSA up to Full Size Exponents}, DOI={<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne}, year={2005}, pages={371–386}, collection={LNCS} }","apa":"Ernst, M., Jochemsz, E., May, A., &#38; de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In <i>EUROCRYPT 2005</i> (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>","ieee":"M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.","short":"M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.","chicago":"Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In <i>EUROCRYPT 2005</i>, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>."},"page":"371-386","_id":"3010","publisher":"Springer Berlin Heidelberg","series_title":"LNCS","doi":"10.1007/11426639_22","user_id":"25078","title":"Partial Key Exposure Attacks on RSA up to Full Size Exponents","year":"2005","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]},"author":[{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"},{"last_name":"Jochemsz","first_name":"Ellen","full_name":"Jochemsz, Ellen"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"},{"first_name":"Benne","last_name":"de Weger","full_name":"de Weger, Benne"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published"},{"date_updated":"2023-10-05T13:38:50Z","author":[{"last_name":"Hornkamp","first_name":"Christian","full_name":"Hornkamp, Christian"}],"status":"public","year":"2005","title":"Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve","user_id":"41047","language":[{"iso":"ger"}],"_id":"47647","citation":{"short":"C. Hornkamp, Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve, 2005.","chicago":"Hornkamp, Christian. <i>Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve</i>, 2005.","apa":"Hornkamp, C. (2005). <i>Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve</i>.","ieee":"C. Hornkamp, <i>Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve</i>. 2005.","ama":"Hornkamp C. <i>Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve</i>.; 2005.","bibtex":"@book{Hornkamp_2005, title={Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve}, author={Hornkamp, Christian}, year={2005} }","mla":"Hornkamp, Christian. <i>Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve</i>. 2005."},"department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","date_created":"2023-10-05T13:35:07Z"},{"user_id":"41047","_id":"47646","language":[{"iso":"ger"}],"date_updated":"2023-10-05T13:38:52Z","year":"2005","status":"public","title":"Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven","author":[{"last_name":"Süß","first_name":"Tim","full_name":"Süß, Tim"}],"type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"date_created":"2023-10-05T13:34:48Z","citation":{"bibtex":"@book{Süß_2005, title={Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven}, author={Süß, Tim}, year={2005} }","ama":"Süß T. <i>Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven</i>.; 2005.","mla":"Süß, Tim. <i>Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven</i>. 2005.","chicago":"Süß, Tim. <i>Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven</i>, 2005.","short":"T. Süß, Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven, 2005.","ieee":"T. Süß, <i>Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven</i>. 2005.","apa":"Süß, T. (2005). <i>Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven</i>."}},{"date_updated":"2023-10-05T16:42:46Z","author":[{"full_name":"Ernst, Matthias","last_name":"Ernst","first_name":"Matthias"}],"status":"public","year":"2005","title":"Analyse von RSA mittels Coppersmith Methode","user_id":"41047","language":[{"iso":"ger"}],"_id":"47693","citation":{"ama":"Ernst M. <i>Analyse von RSA mittels Coppersmith Methode</i>.; 2005.","bibtex":"@book{Ernst_2005, title={Analyse von RSA mittels Coppersmith Methode}, author={Ernst, Matthias}, year={2005} }","mla":"Ernst, Matthias. <i>Analyse von RSA mittels Coppersmith Methode</i>. 2005.","chicago":"Ernst, Matthias. <i>Analyse von RSA mittels Coppersmith Methode</i>, 2005.","short":"M. Ernst, Analyse von RSA mittels Coppersmith Methode, 2005.","apa":"Ernst, M. (2005). <i>Analyse von RSA mittels Coppersmith Methode</i>.","ieee":"M. Ernst, <i>Analyse von RSA mittels Coppersmith Methode</i>. 2005."},"department":[{"_id":"34"},{"_id":"64"}],"type":"misc","keyword":["Diplomarbeit"],"date_created":"2023-10-05T16:35:58Z"},{"file_date_updated":"2023-10-05T16:54:25Z","citation":{"mla":"Spanke, Christoph. <i>Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA</i>. 2005.","apa":"Spanke, C. (2005). <i>Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA</i>.","ieee":"C. Spanke, <i>Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA</i>. 2005.","chicago":"Spanke, Christoph. <i>Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA</i>, 2005.","short":"C. Spanke, Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA, 2005.","ama":"Spanke C. <i>Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA</i>.; 2005.","bibtex":"@book{Spanke_2005, title={Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA}, author={Spanke, Christoph}, year={2005} }"},"file":[{"creator":"bhenrik","date_created":"2023-10-05T16:36:33Z","access_level":"open_access","file_size":783523,"file_name":"2005_Spanke_ImplemetierungCoppersmith.ps","date_updated":"2023-10-05T16:54:25Z","relation":"main_file","content_type":"application/postscript","file_id":"47720"}],"date_created":"2023-10-05T16:36:44Z","type":"misc","keyword":["Diplomarbeit"],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"status":"public","title":"Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA","year":"2005","author":[{"first_name":"Christoph","last_name":"Spanke","full_name":"Spanke, Christoph"}],"date_updated":"2023-10-05T16:54:25Z","has_accepted_license":"1","_id":"47694","language":[{"iso":"ger"}],"ddc":["000"],"user_id":"41047"},{"publication_status":"published","date_updated":"2022-01-06T06:58:51Z","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Guajardo, Jorge","last_name":"Guajardo","first_name":"Jorge"},{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"}],"publication_identifier":{"isbn":["9783540243274","9783540305644"],"issn":["0302-9743","1611-3349"]},"year":"2004","status":"public","title":"Provably Secure Masking of AES","user_id":"25078","doi":"10.1007/978-3-540-30564-4_5","publisher":"Springer Berlin Heidelberg","_id":"3011","page":"69-83","citation":{"chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In <i>Selected Areas in Cryptography</i>, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.","ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>."},"publication":"Selected Areas in Cryptography","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:20:20Z","place":"Berlin, Heidelberg"},{"publication":"Public Key Cryptography – PKC 2004","type":"book_chapter","department":[{"_id":"64"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"3013","date_updated":"2018-06-05T08:21:31Z","relation":"main_file","file_size":198120,"access_level":"closed","file_name":"keys.pdf","date_created":"2018-06-05T08:21:31Z","creator":"feidens"}],"date_created":"2018-06-05T08:20:59Z","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","title":"A Generalized Wiener Attack on RSA","year":"2004","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"publication_identifier":{"isbn":["9783540210184","9783540246329"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-24632-9_1","file_date_updated":"2018-06-05T08:21:31Z","citation":{"mla":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>.","bibtex":"@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>","ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.","apa":"Blömer, J., &#38; May, A. (2004). A Generalized Wiener Attack on RSA. In <i>Public Key Cryptography – PKC 2004</i> (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>","chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>.","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13."},"place":"Berlin, Heidelberg","has_accepted_license":"1","status":"public","user_id":"25078","ddc":["000"],"page":"1-13","publisher":"Springer Berlin Heidelberg","_id":"3012"},{"user_id":"25078","doi":"10.1007/978-3-540-24632-9_16","page":"218-230","publisher":"Springer Berlin Heidelberg","_id":"3014","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","title":"Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q","year":"2004","status":"public","author":[{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-05T08:22:02Z","place":"Berlin, Heidelberg","publication":"Public Key Cryptography – PKC 2004","citation":{"mla":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>.","apa":"May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In <i>Public Key Cryptography – PKC 2004</i> (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>","ieee":"A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.","short":"A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.","ama":"May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>","chicago":"May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” In <i>Public Key Cryptography – PKC 2004</i>, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">https://doi.org/10.1007/978-3-540-24632-9_16</a>.","bibtex":"@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_16\">10.1007/978-3-540-24632-9_16</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2004}, pages={218–230} }"}},{"user_id":"25078","doi":"10.1007/978-3-540-28628-8_13","page":"213-219","_id":"3015","publisher":"Springer Berlin Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","status":"public","title":"Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring","year":"2004","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540226680","9783540286288"]},"author":[{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-05T08:23:43Z","place":"Berlin, Heidelberg","publication":"Advances in Cryptology – CRYPTO 2004","citation":{"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.","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>","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>.","short":"A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.","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>.","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>"}},{"citation":{"ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>, 2004.","apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>. ACM Press. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press, 2004. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004.","mla":"Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>, ACM Press, 2004, doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>.","bibtex":"@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm secure against bellcore attacks}, DOI={<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>}, booktitle={Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03}, publisher={ACM Press}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2004} }","ama":"Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press; 2004. doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>"},"publication":"Proceedings of the 10th ACM conference on Computer and communication security  - CCS '03","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T08:24:48Z","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Otto, Martin","last_name":"Otto","first_name":"Martin"},{"last_name":"Seifert","first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre"}],"publication_identifier":{"isbn":["1581137389"]},"year":"2004","title":"A new CRT-RSA algorithm secure against bellcore attacks","status":"public","user_id":"25078","doi":"10.1145/948109.948151","publisher":"ACM Press","_id":"3017"},{"author":[{"full_name":"Dumrauf, Dominic","last_name":"Dumrauf","first_name":"Dominic"}],"status":"public","title":"Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen","year":"2004","date_updated":"2023-10-05T13:38:53Z","_id":"47645","language":[{"iso":"ger"}],"user_id":"41047","citation":{"bibtex":"@book{Dumrauf_2004, title={Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen}, author={Dumrauf, Dominic}, year={2004} }","ama":"Dumrauf D. <i>Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen</i>.; 2004.","mla":"Dumrauf, Dominic. <i>Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen</i>. 2004.","chicago":"Dumrauf, Dominic. <i>Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen</i>, 2004.","short":"D. Dumrauf, Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen, 2004.","ieee":"D. Dumrauf, <i>Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen</i>. 2004.","apa":"Dumrauf, D. (2004). <i>Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen</i>."},"date_created":"2023-10-05T13:34:24Z","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis"},{"citation":{"ieee":"T. Herden, <i>Implementierung und Evaluierung eines Angriffs auf DSA</i>. 2004.","mla":"Herden, Tim. <i>Implementierung und Evaluierung eines Angriffs auf DSA</i>. 2004.","apa":"Herden, T. (2004). <i>Implementierung und Evaluierung eines Angriffs auf DSA</i>.","bibtex":"@book{Herden_2004, title={Implementierung und Evaluierung eines Angriffs auf DSA}, author={Herden, Tim}, year={2004} }","chicago":"Herden, Tim. <i>Implementierung und Evaluierung eines Angriffs auf DSA</i>, 2004.","ama":"Herden T. <i>Implementierung und Evaluierung eines Angriffs auf DSA</i>.; 2004.","short":"T. Herden, Implementierung und Evaluierung eines Angriffs auf DSA, 2004."},"department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","date_created":"2023-10-05T13:33:32Z","date_updated":"2023-10-05T13:39:00Z","author":[{"full_name":"Herden, Tim","first_name":"Tim","last_name":"Herden"}],"title":"Implementierung und Evaluierung eines Angriffs auf DSA","status":"public","year":"2004","user_id":"41047","_id":"47642","language":[{"iso":"ger"}]},{"status":"public","title":"Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes","year":"2004","author":[{"full_name":"Gesemann, Sebastian","last_name":"Gesemann","first_name":"Sebastian"}],"date_updated":"2023-10-05T22:09:01Z","has_accepted_license":"1","language":[{"iso":"ger"}],"_id":"47644","ddc":["000"],"user_id":"41047","file_date_updated":"2023-10-05T22:09:01Z","citation":{"bibtex":"@book{Gesemann_2004, title={Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes}, author={Gesemann, Sebastian}, year={2004} }","short":"S. Gesemann, Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes, 2004.","ama":"Gesemann S. <i>Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes</i>.; 2004.","chicago":"Gesemann, Sebastian. <i>Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes</i>, 2004.","ieee":"S. Gesemann, <i>Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes</i>. 2004.","mla":"Gesemann, Sebastian. <i>Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes</i>. 2004.","apa":"Gesemann, S. (2004). <i>Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes</i>."},"file":[{"content_type":"application/postscript","file_id":"47790","date_updated":"2023-10-05T22:09:01Z","relation":"main_file","access_level":"open_access","file_size":236287,"file_name":"2004_Gesemann_ImplementierungEinesVerfahrensZurBerechnungOptimalerLaengenbeschraenkterPraefixCodes.ps","date_created":"2023-10-05T22:04:42Z","creator":"bhenrik"}],"date_created":"2023-10-05T13:34:08Z","type":"bachelorsthesis","oa":"1","department":[{"_id":"34"},{"_id":"64"}]},{"language":[{"iso":"ger"}],"_id":"47643","ddc":["000"],"user_id":"41047","author":[{"last_name":"Gorski","first_name":"Michael","full_name":"Gorski, Michael"}],"title":"Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven","status":"public","year":"2004","has_accepted_license":"1","date_updated":"2023-10-05T22:09:09Z","date_created":"2023-10-05T13:33:51Z","file":[{"date_created":"2023-10-05T22:04:24Z","creator":"bhenrik","file_id":"47789","content_type":"application/zip","file_name":"2004_Gorski_Schoof-Algorithmus.zip","file_size":567686,"access_level":"open_access","relation":"main_file","date_updated":"2023-10-05T22:09:09Z"}],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","citation":{"ama":"Gorski M. <i>Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven</i>.; 2004.","bibtex":"@book{Gorski_2004, title={Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven}, author={Gorski, Michael}, year={2004} }","mla":"Gorski, Michael. <i>Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven</i>. 2004.","chicago":"Gorski, Michael. <i>Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven</i>, 2004.","short":"M. Gorski, Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven, 2004.","apa":"Gorski, M. (2004). <i>Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven</i>.","ieee":"M. Gorski, <i>Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven</i>. 2004."},"file_date_updated":"2023-10-05T22:09:09Z"},{"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"citation":{"short":"A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, Universität Paderborn, 2003.","chicago":"May, Alexander. <i>New RSA Vulnerabilities Using Lattice Reduction Methods</i>. Universität Paderborn, 2003.","apa":"May, A. (2003). <i>New RSA Vulnerabilities Using Lattice Reduction Methods</i>. Universität Paderborn.","ieee":"A. May, <i>New RSA Vulnerabilities Using Lattice Reduction Methods</i>. Universität Paderborn, 2003.","ama":"May A. <i>New RSA Vulnerabilities Using Lattice Reduction Methods</i>. Universität Paderborn; 2003.","bibtex":"@book{May_2003, title={New RSA Vulnerabilities Using Lattice Reduction Methods}, publisher={Universität Paderborn}, author={May, Alexander}, year={2003} }","mla":"May, Alexander. <i>New RSA Vulnerabilities Using Lattice Reduction Methods</i>. Universität Paderborn, 2003."},"department":[{"_id":"64"}],"type":"dissertation","date_created":"2018-05-25T10:51:42Z","date_updated":"2022-01-06T06:58:46Z","author":[{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"year":"2003","status":"public","title":"New RSA Vulnerabilities Using Lattice Reduction Methods","user_id":"25078","publisher":"Universität Paderborn","_id":"2914","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20030101205"}]},{"doi":"10.1007/978-3-540-45146-4_2","user_id":"25078","page":"27-43","publisher":"Springer Berlin Heidelberg","_id":"3016","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","year":"2003","title":"New Partial Key Exposure Attacks on RSA","status":"public","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"publication_identifier":{"isbn":["9783540406747","9783540451464"],"issn":["0302-9743","1611-3349"]},"type":"book_chapter","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:24:11Z","publication":"Advances in Cryptology - CRYPTO 2003","citation":{"apa":"Blömer, J., &#38; May, A. (2003). New Partial Key Exposure Attacks on RSA. In <i>Advances in Cryptology - CRYPTO 2003</i> (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>","ieee":"J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in <i>Advances in Cryptology - CRYPTO 2003</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.","chicago":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In <i>Advances in Cryptology - CRYPTO 2003</i>, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>.","short":"J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.","mla":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” <i>Advances in Cryptology - CRYPTO 2003</i>, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>.","ama":"Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: <i>Advances in Cryptology - CRYPTO 2003</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>","bibtex":"@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }"}}]