[{"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"},{"full_name":"Silverman, Joseph H.","last_name":"Silverman","first_name":"Joseph H."}],"title":"Dimension Reduction Methods for Convolution Modular Lattices","year":"2007","status":"public","doi":"10.1007/3-540-44670-2_10","user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3022","page":"110-125","citation":{"ama":"May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>","bibtex":"@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension Reduction Methods for Convolution Modular Lattices}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125} }","mla":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>.","chicago":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” In <i>Lecture Notes in Computer Science</i>, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>.","short":"A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.","apa":"May, A., &#38; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In <i>Lecture Notes in Computer Science</i> (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>","ieee":"A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125."},"publication":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:27:10Z"},{"publication_status":"published","date_updated":"2022-01-06T06:58:51Z","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","year":"2007","status":"public","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"user_id":"25078","doi":"10.1007/3-540-68530-8_13","page":"151-162","_id":"3026","publisher":"Springer Berlin Heidelberg","publication":"Algorithms — ESA’ 98","citation":{"mla":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” <i>Algorithms — ESA’ 98</i>, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>.","ama":"Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>","bibtex":"@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>}, booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2007}, pages={151–162} }","apa":"Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In <i>Algorithms — ESA’ 98</i> (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>","ieee":"J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.","chicago":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In <i>Algorithms — ESA’ 98</i>, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>."},"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-05T08:28:39Z","place":"Berlin, Heidelberg"},{"author":[{"last_name":"Ziegert","first_name":"Steffen","full_name":"Ziegert, Steffen"}],"year":"2007","status":"public","title":"Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem","date_updated":"2023-10-05T13:38:45Z","language":[{"iso":"ger"}],"_id":"47650","user_id":"41047","citation":{"mla":"Ziegert, Steffen. <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>. 2007.","apa":"Ziegert, S. (2007). <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>.","ieee":"S. Ziegert, <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>. 2007.","chicago":"Ziegert, Steffen. <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>, 2007.","short":"S. Ziegert, Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem, 2007.","ama":"Ziegert S. <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>.; 2007.","bibtex":"@book{Ziegert_2007, title={Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem}, author={Ziegert, Steffen}, year={2007} }"},"date_created":"2023-10-05T13:36:17Z","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis"},{"language":[{"iso":"ger"}],"_id":"47651","user_id":"41047","status":"public","title":"Sichere Kryptosysteme durch Zero-Knowledge","year":"2007","author":[{"full_name":"Richert, Manuel","last_name":"Richert","first_name":"Manuel"}],"date_updated":"2023-10-05T13:38:45Z","date_created":"2023-10-05T13:36:33Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"citation":{"mla":"Richert, Manuel. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>. 2007.","ama":"Richert M. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>.; 2007.","bibtex":"@book{Richert_2007, title={Sichere Kryptosysteme durch Zero-Knowledge}, author={Richert, Manuel}, year={2007} }","apa":"Richert, M. (2007). <i>Sichere Kryptosysteme durch Zero-Knowledge</i>.","ieee":"M. Richert, <i>Sichere Kryptosysteme durch Zero-Knowledge</i>. 2007.","chicago":"Richert, Manuel. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>, 2007.","short":"M. Richert, Sichere Kryptosysteme durch Zero-Knowledge, 2007."}},{"citation":{"bibtex":"@book{Klein_2007, title={Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln}, author={Klein, Wiebke}, year={2007} }","chicago":"Klein, Wiebke. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>, 2007.","ama":"Klein W. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>.; 2007.","short":"W. Klein, Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln, 2007.","ieee":"W. Klein, <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>. 2007.","apa":"Klein, W. (2007). <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>.","mla":"Klein, Wiebke. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>. 2007."},"keyword":["Diplomarbeit"],"type":"misc","department":[{"_id":"34"},{"_id":"64"}],"date_created":"2023-10-05T16:32:56Z","date_updated":"2023-10-05T16:42:53Z","status":"public","year":"2007","title":"Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln","author":[{"full_name":"Klein, Wiebke","first_name":"Wiebke","last_name":"Klein"}],"user_id":"41047","_id":"47688","language":[{"iso":"ger"}]},{"citation":{"short":"O. Käthler, Kryptanalyse des EAC-Protokolls biometrischer Reisepässe, 2007.","chicago":"Käthler, Olga. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>, 2007.","apa":"Käthler, O. (2007). <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.","ieee":"O. Käthler, <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>. 2007.","ama":"Käthler O. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.; 2007.","bibtex":"@book{Käthler_2007, title={Kryptanalyse des EAC-Protokolls biometrischer Reisepässe}, author={Käthler, Olga}, year={2007} }","mla":"Käthler, Olga. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>. 2007."},"date_created":"2023-10-05T16:34:07Z","type":"misc","keyword":["Diplomarbeit"],"department":[{"_id":"34"},{"_id":"64"}],"status":"public","title":"Kryptanalyse des EAC-Protokolls biometrischer Reisepässe","year":"2007","author":[{"last_name":"Käthler","first_name":"Olga","full_name":"Käthler, Olga"}],"date_updated":"2023-10-05T16:42:51Z","language":[{"iso":"ger"}],"_id":"47690","user_id":"41047"},{"citation":{"chicago":"Brieden, Benedikt. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode</i>, 2007.","short":"B. Brieden, Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode, 2007.","ieee":"B. Brieden, <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode</i>. 2007.","apa":"Brieden, B. (2007). <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode</i>.","bibtex":"@book{Brieden_2007, title={Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode}, author={Brieden, Benedikt}, year={2007} }","ama":"Brieden B. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode</i>.; 2007.","mla":"Brieden, Benedikt. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode</i>. 2007."},"file_date_updated":"2023-10-05T16:53:56Z","oa":"1","department":[{"_id":"34"},{"_id":"64"}],"type":"misc","keyword":["Diplomarbeit"],"date_created":"2023-10-05T16:32:37Z","file":[{"date_created":"2023-10-05T16:32:30Z","creator":"bhenrik","file_id":"47713","content_type":"application/pdf","file_name":"2007_Brieden_AnalyseVonVerallgemeinertenRSAPolynomenMitHilfeDerCoppersmithschenMethode.pdf","file_size":612732,"access_level":"open_access","relation":"main_file","date_updated":"2023-10-05T16:53:56Z"}],"has_accepted_license":"1","date_updated":"2023-10-05T16:53:56Z","author":[{"first_name":"Benedikt","last_name":"Brieden","full_name":"Brieden, Benedikt"}],"title":"Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode","year":"2007","status":"public","ddc":["000"],"user_id":"41047","_id":"47687","language":[{"iso":"ger"}]},{"ddc":["000"],"user_id":"41047","language":[{"iso":"ger"}],"_id":"47689","has_accepted_license":"1","date_updated":"2023-10-05T16:54:04Z","author":[{"full_name":"Kuntze, Daniel","last_name":"Kuntze","first_name":"Daniel"}],"title":"Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz","status":"public","year":"2007","oa":"1","department":[{"_id":"34"},{"_id":"64"}],"keyword":["Diplomarbeit"],"type":"misc","date_created":"2023-10-05T16:33:44Z","file":[{"content_type":"application/pdf","file_id":"47715","date_updated":"2023-10-05T16:54:04Z","relation":"main_file","file_size":1078135,"access_level":"open_access","file_name":"2007_Kuntze_UntersuchungVonClusteringalgorithmenFuerDieKLD.pdf","date_created":"2023-10-05T16:33:38Z","creator":"bhenrik"}],"citation":{"apa":"Kuntze, D. (2007). <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz</i>.","ieee":"D. Kuntze, <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz</i>. 2007.","chicago":"Kuntze, Daniel. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz</i>, 2007.","short":"D. Kuntze, Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz, 2007.","mla":"Kuntze, Daniel. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz</i>. 2007.","ama":"Kuntze D. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz</i>.; 2007.","bibtex":"@book{Kuntze_2007, title={Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz}, author={Kuntze, Daniel}, year={2007} }"},"file_date_updated":"2023-10-05T16:54:04Z"},{"date_created":"2023-10-05T16:31:03Z","file":[{"date_created":"2023-10-05T16:30:56Z","creator":"bhenrik","file_id":"47711","content_type":"application/pdf","file_name":"2007_Borghoff_VergleichMultivariaterVariantenDerMethodeVonCoppersmith.pdf","access_level":"open_access","file_size":550560,"relation":"main_file","date_updated":"2023-10-05T16:53:40Z"}],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"type":"misc","keyword":["Diplomarbeit"],"citation":{"mla":"Borghoff, Julia. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>. 2007.","apa":"Borghoff, J. (2007). <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.","ieee":"J. Borghoff, <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>. 2007.","ama":"Borghoff J. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.; 2007.","short":"J. Borghoff, Vergleich multivariater Varianten der Methode von Coppersmith, 2007.","chicago":"Borghoff, Julia. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>, 2007.","bibtex":"@book{Borghoff_2007, title={Vergleich multivariater Varianten der Methode von Coppersmith}, author={Borghoff, Julia}, year={2007} }"},"file_date_updated":"2023-10-05T16:53:40Z","language":[{"iso":"ger"}],"_id":"47686","ddc":["000"],"user_id":"41047","author":[{"last_name":"Borghoff","first_name":"Julia","full_name":"Borghoff, Julia"}],"title":"Vergleich multivariater Varianten der Methode von Coppersmith","year":"2007","status":"public","has_accepted_license":"1","date_updated":"2023-10-05T16:53:40Z"},{"date_updated":"2023-10-05T22:10:22Z","has_accepted_license":"1","status":"public","title":"Untersuchungen zur Sicherheit einzelner RSA Bits","year":"2007","author":[{"full_name":"Landwehr, Andreas Cord","first_name":"Andreas Cord","last_name":"Landwehr"}],"user_id":"41047","ddc":["000"],"_id":"2887","language":[{"iso":"ger"}],"file_date_updated":"2023-10-05T22:10:21Z","citation":{"short":"A.C. Landwehr, Untersuchungen zur Sicherheit einzelner RSA Bits, 2007.","ama":"Landwehr AC. <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>.; 2007.","chicago":"Landwehr, Andreas Cord. <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>, 2007.","bibtex":"@book{Landwehr_2007, title={Untersuchungen zur Sicherheit einzelner RSA Bits}, author={Landwehr, Andreas Cord}, year={2007} }","mla":"Landwehr, Andreas Cord. <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>. 2007.","apa":"Landwehr, A. C. (2007). <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>.","ieee":"A. C. Landwehr, <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>. 2007."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"oa":"1","file":[{"date_created":"2018-05-25T09:12:31Z","creator":"feidens","file_id":"2888","content_type":"application/pdf","relation":"main_file","date_updated":"2023-10-05T22:10:21Z","file_name":"2007_CordLandwehr_UntersuchungenZurSicherheitEinzelnerRSABits.pdf","file_size":889440,"access_level":"open_access"}],"date_created":"2018-05-25T09:12:40Z"},{"year":"2007","title":"Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT","status":"public","author":[{"first_name":"Jaroslaw","last_name":"Klose","full_name":"Klose, Jaroslaw"}],"date_updated":"2023-10-05T22:11:02Z","has_accepted_license":"1","_id":"47653","language":[{"iso":"ger"}],"ddc":["000"],"user_id":"41047","file_date_updated":"2023-10-05T22:11:02Z","citation":{"apa":"Klose, J. (2007). <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT</i>.","ieee":"J. Klose, <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT</i>. 2007.","short":"J. Klose, Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT, 2007.","chicago":"Klose, Jaroslaw. <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT</i>, 2007.","mla":"Klose, Jaroslaw. <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT</i>. 2007.","ama":"Klose J. <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT</i>.; 2007.","bibtex":"@book{Klose_2007, title={Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT}, author={Klose, Jaroslaw}, year={2007} }"},"file":[{"creator":"bhenrik","date_created":"2023-10-05T22:06:24Z","relation":"main_file","date_updated":"2023-10-05T22:11:02Z","file_name":"2007_Klose_EinErschoepfendeSucheVermeidenderAlgorithmusFuerAllgemeinesKSAT.pdf","access_level":"open_access","file_size":820701,"file_id":"47793","content_type":"application/pdf"}],"date_created":"2023-10-05T13:37:05Z","type":"bachelorsthesis","oa":"1","department":[{"_id":"34"},{"_id":"64"}]},{"date_updated":"2023-10-05T22:10:53Z","has_accepted_license":"1","status":"public","year":"2007","title":"Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen","author":[{"last_name":"Niemeier","first_name":"Martin","full_name":"Niemeier, Martin"}],"user_id":"41047","ddc":["000"],"_id":"47652","language":[{"iso":"ger"}],"file_date_updated":"2023-10-05T22:10:53Z","citation":{"mla":"Niemeier, Martin. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen</i>. 2007.","apa":"Niemeier, M. (2007). <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen</i>.","ieee":"M. Niemeier, <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen</i>. 2007.","chicago":"Niemeier, Martin. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen</i>, 2007.","ama":"Niemeier M. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen</i>.; 2007.","short":"M. Niemeier, Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen, 2007.","bibtex":"@book{Niemeier_2007, title={Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen}, author={Niemeier, Martin}, year={2007} }"},"type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","file":[{"creator":"bhenrik","date_created":"2023-10-05T22:06:09Z","file_name":"2007_Niemeier_ReduktionenVonCVPMitWenigenLoesungenAufCVPMitEindeutigenLoesungen.pdf","access_level":"open_access","file_size":719476,"relation":"main_file","date_updated":"2023-10-05T22:10:53Z","file_id":"47792","content_type":"application/pdf"}],"date_created":"2023-10-05T13:36:48Z"},{"ddc":["000"],"user_id":"41047","language":[{"iso":"ger"}],"_id":"47654","date_updated":"2023-10-05T22:11:15Z","has_accepted_license":"1","title":"Behandlung von Korrekturtermen in der Methode von Coppersmith","status":"public","year":"2007","author":[{"full_name":"Birkner, Stefan","first_name":"Stefan","last_name":"Birkner"}],"type":"bachelorsthesis","oa":"1","department":[{"_id":"34"},{"_id":"64"}],"file":[{"creator":"bhenrik","date_created":"2023-10-05T22:06:38Z","file_name":"2007_Birkner_BehandlungVonKorrekturtermenInDerMethodeVonCoppersmith.pdf","access_level":"open_access","file_size":185880,"relation":"main_file","date_updated":"2023-10-05T22:11:14Z","file_id":"47794","content_type":"application/pdf"}],"date_created":"2023-10-05T13:37:30Z","file_date_updated":"2023-10-05T22:11:14Z","citation":{"chicago":"Birkner, Stefan. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>, 2007.","short":"S. Birkner, Behandlung von Korrekturtermen in der Methode von Coppersmith, 2007.","ieee":"S. Birkner, <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>. 2007.","apa":"Birkner, S. (2007). <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.","bibtex":"@book{Birkner_2007, title={Behandlung von Korrekturtermen in der Methode von Coppersmith}, author={Birkner, Stefan}, year={2007} }","ama":"Birkner S. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.; 2007.","mla":"Birkner, Stefan. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>. 2007."}},{"_id":"55571","language":[{"iso":"eng"}],"publisher":"Springer Verlag","series_title":"Lecture notes in Computer Science. Invited to Theoretical Computer Science","page":"65-77","volume":4596,"user_id":"49063","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"id":"1971","first_name":"Stefanie","last_name":" Naewe","full_name":" Naewe, Stefanie"}],"title":"Sampling methods for shortest vectors, closest vectors and successive minima","status":"public","year":"2007","intvolume":"      4596","publication_status":"published","date_updated":"2024-08-08T12:14:09Z","date_created":"2024-08-08T12:14:05Z","department":[{"_id":"64"}],"type":"conference","citation":{"mla":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Proceedings of the 34th ICALP</i>, vol. 4596, Springer Verlag, 2007, pp. 65–77.","bibtex":"@inproceedings{Blömer_ Naewe_2007, series={Lecture notes in Computer Science. Invited to Theoretical Computer Science}, title={Sampling methods for shortest vectors, closest vectors and successive minima}, volume={4596}, booktitle={Proceedings of the 34th ICALP}, publisher={Springer Verlag}, author={Blömer, Johannes and  Naewe, Stefanie}, year={2007}, pages={65–77}, collection={Lecture notes in Computer Science. Invited to Theoretical Computer Science} }","ama":"Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. In: <i>Proceedings of the 34th ICALP</i>. Vol 4596. Lecture notes in Computer Science. Invited to Theoretical Computer Science. Springer Verlag; 2007:65-77.","ieee":"J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” in <i>Proceedings of the 34th ICALP</i>, 2007, vol. 4596, pp. 65–77.","apa":"Blömer, J., &#38;  Naewe, S. (2007). Sampling methods for shortest vectors, closest vectors and successive minima. <i>Proceedings of the 34th ICALP</i>, <i>4596</i>, 65–77.","chicago":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” In <i>Proceedings of the 34th ICALP</i>, 4596:65–77. Lecture Notes in Computer Science. Invited to Theoretical Computer Science. Springer Verlag, 2007.","short":"J. Blömer, S.  Naewe, in: Proceedings of the 34th ICALP, Springer Verlag, 2007, pp. 65–77."},"publication":"Proceedings of the 34th ICALP"},{"department":[{"_id":"64"}],"type":"journal_article","date_created":"2018-06-05T08:13:39Z","abstract":[{"lang":"eng","text":"We give a brief introduction to probabilistic encryptions. This serves as an example how randomness plays a pivotal role in cryptographic systems that satisfy advanced security concepts."}],"citation":{"apa":"Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. <i>Journal of Universal Computer Science (J.UCS)</i>, (6), 654--671. <a href=\"https://doi.org/10.3217/jucs-012-06-0654\">https://doi.org/10.3217/jucs-012-06-0654</a>","ieee":"J. Blömer, “Randomness and Secrecy - A Brief Introduction,” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6, pp. 654--671, 2006.","chicago":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6 (2006): 654--671. <a href=\"https://doi.org/10.3217/jucs-012-06-0654\">https://doi.org/10.3217/jucs-012-06-0654</a>.","short":"J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.","mla":"Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal of Universal Computer Science (J.UCS)</i>, no. 6, 2006, pp. 654--671, doi:<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>.","ama":"Blömer J. Randomness and Secrecy - A Brief Introduction. <i>Journal of Universal Computer Science (JUCS)</i>. 2006;(6):654--671. doi:<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>","bibtex":"@article{Blömer_2006, title={Randomness and Secrecy - A Brief Introduction}, DOI={<a href=\"https://doi.org/10.3217/jucs-012-06-0654\">10.3217/jucs-012-06-0654</a>}, number={6}, journal={Journal of Universal Computer Science (J.UCS)}, author={Blömer, Johannes}, year={2006}, pages={654--671} }"},"publication":"Journal of Universal Computer Science (J.UCS)","issue":"6","user_id":"25078","doi":"10.3217/jucs-012-06-0654","_id":"3003","page":"654--671","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"title":"Randomness and Secrecy - A Brief Introduction","year":"2006","status":"public"},{"_id":"3004","publisher":"Springer Berlin Heidelberg","page":"106-120","user_id":"25078","doi":"10.1007/11889700_11","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"Krummel, Volker","first_name":"Volker","last_name":"Krummel"}],"publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"status":"public","title":"Fault Based Collision Attacks on AES","year":"2006","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","date_created":"2018-06-05T08:14:42Z","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"type":"book_chapter","citation":{"short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","ama":"Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>","chicago":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>.","bibtex":"@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based Collision Attacks on AES}, DOI={<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }","apa":"Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES. In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>","mla":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>.","ieee":"J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120."},"publication":"Lecture Notes in Computer Science"},{"doi":"10.1007/11889700_2","user_id":"25078","_id":"3005","publisher":"Springer Berlin Heidelberg","page":"13-23","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Otto","first_name":"Martin","full_name":"Otto, Martin"}],"title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","status":"public","year":"2006","department":[{"_id":"64"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:15:48Z","citation":{"apa":"Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>","ieee":"J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.","chicago":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>.","short":"J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.","mla":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>.","ama":"Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>","bibtex":"@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }"},"publication":"Lecture Notes in Computer Science"},{"page":"36-52","publisher":"Springer Berlin Heidelberg","_id":"3007","user_id":"25078","ddc":["000"],"status":"public","has_accepted_license":"1","place":"Berlin, Heidelberg","file_date_updated":"2018-06-05T08:18:56Z","citation":{"apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In <i>Lecture Notes in Computer Science</i> (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>","mla":"Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>.","ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","ama":"Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In <i>Lecture Notes in Computer Science</i>, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>.","bibtex":"@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006}, pages={36–52} }"},"doi":"10.1007/11889700_4","year":"2006","title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Otto, Martin","last_name":"Otto","first_name":"Martin"},{"full_name":"Seifert, Jean-Pierre","last_name":"Seifert","first_name":"Jean-Pierre"}],"publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:58:50Z","file":[{"file_name":"SignChangeFaultAttacksOnECC.pdf","file_size":259146,"access_level":"closed","relation":"main_file","date_updated":"2018-06-05T08:18:56Z","file_id":"3009","content_type":"application/pdf","success":1,"creator":"feidens","date_created":"2018-06-05T08:18:56Z"}],"date_created":"2018-06-05T08:17:12Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science"},{"language":[{"iso":"ger"}],"_id":"47649","user_id":"41047","author":[{"first_name":"Rafael","last_name":"Funke","full_name":"Funke, Rafael"}],"status":"public","year":"2006","title":"Implementierung und Simulation von Cache-Angriffen auf AES","date_updated":"2023-10-05T13:38:48Z","date_created":"2023-10-05T13:35:58Z","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","citation":{"mla":"Funke, Rafael. <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>. 2006.","ama":"Funke R. <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>.; 2006.","bibtex":"@book{Funke_2006, title={Implementierung und Simulation von Cache-Angriffen auf AES}, author={Funke, Rafael}, year={2006} }","apa":"Funke, R. (2006). <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>.","ieee":"R. Funke, <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>. 2006.","chicago":"Funke, Rafael. <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>, 2006.","short":"R. Funke, Implementierung und Simulation von Cache-Angriffen auf AES, 2006."}},{"date_created":"2023-10-05T13:35:24Z","file":[{"file_id":"47791","content_type":"application/pdf","file_name":"2006_Schrieb_VonIdentitaetsbasiertenKryptosystemenZuCCASicherheit.pdf","access_level":"open_access","file_size":1091810,"relation":"main_file","date_updated":"2023-10-05T22:09:19Z","date_created":"2023-10-05T22:05:00Z","creator":"bhenrik"}],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","citation":{"ieee":"J. Schrieb, <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>. 2006.","apa":"Schrieb, J. (2006). <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.","chicago":"Schrieb, Jonas. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>, 2006.","short":"J. Schrieb, Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit, 2006.","mla":"Schrieb, Jonas. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>. 2006.","bibtex":"@book{Schrieb_2006, title={Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit}, author={Schrieb, Jonas}, year={2006} }","ama":"Schrieb J. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.; 2006."},"file_date_updated":"2023-10-05T22:09:19Z","language":[{"iso":"ger"}],"_id":"47648","ddc":["000"],"user_id":"41047","author":[{"last_name":"Schrieb","first_name":"Jonas","full_name":"Schrieb, Jonas"}],"year":"2006","status":"public","title":"Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit","has_accepted_license":"1","date_updated":"2023-10-05T22:09:19Z"}]