[{"user_id":"25078","doi":"10.1007/978-3-540-45126-6_12","publisher":"Springer Berlin Heidelberg","_id":"3018","page":"162-181","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":"Seifert, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Seifert"}],"publication_identifier":{"isbn":["9783540406631","9783540451266"],"issn":["0302-9743","1611-3349"]},"year":"2003","title":"Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)","status":"public","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:25:18Z","place":"Berlin, Heidelberg","citation":{"ieee":"J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.","apa":"Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>.","bibtex":"@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>.","ama":"Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>","short":"J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181."},"publication":"Financial Cryptography"},{"language":[{"iso":"ger"}],"_id":"47641","user_id":"41047","year":"2003","status":"public","title":"Asymptotische Optimalität von LZ77 bei beschränktem Speicher","author":[{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"}],"date_updated":"2023-10-05T13:39:01Z","date_created":"2023-10-05T13:33:11Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"citation":{"apa":"Ernst, M. (2003). <i>Asymptotische Optimalität von LZ77 bei beschränktem Speicher</i>.","ieee":"M. Ernst, <i>Asymptotische Optimalität von LZ77 bei beschränktem Speicher</i>. 2003.","chicago":"Ernst, Matthias. <i>Asymptotische Optimalität von LZ77 bei beschränktem Speicher</i>, 2003.","short":"M. Ernst, Asymptotische Optimalität von LZ77 bei beschränktem Speicher, 2003.","mla":"Ernst, Matthias. <i>Asymptotische Optimalität von LZ77 bei beschränktem Speicher</i>. 2003.","ama":"Ernst M. <i>Asymptotische Optimalität von LZ77 bei beschränktem Speicher</i>.; 2003.","bibtex":"@book{Ernst_2003, title={Asymptotische Optimalität von LZ77 bei beschränktem Speicher}, author={Ernst, Matthias}, year={2003} }"}},{"date_updated":"2023-10-05T13:39:08Z","title":"Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen","status":"public","year":"2003","author":[{"full_name":"Voß, Kerstin","first_name":"Kerstin","last_name":"Voß"}],"user_id":"41047","language":[{"iso":"ger"}],"_id":"47635","citation":{"apa":"Voß, K. (2003). <i>Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen</i>.","ieee":"K. Voß, <i>Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen</i>. 2003.","short":"K. Voß, Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen, 2003.","chicago":"Voß, Kerstin. <i>Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen</i>, 2003.","mla":"Voß, Kerstin. <i>Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen</i>. 2003.","ama":"Voß K. <i>Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen</i>.; 2003.","bibtex":"@book{Voß_2003, title={Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen}, author={Voß, Kerstin}, year={2003} }"},"type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"date_created":"2023-10-05T13:30:48Z"},{"citation":{"mla":"Hoppe, Ulrich. <i>Markovprozesse zur Modellierung bei Codekompression</i>. 2003.","apa":"Hoppe, U. (2003). <i>Markovprozesse zur Modellierung bei Codekompression</i>.","ieee":"U. Hoppe, <i>Markovprozesse zur Modellierung bei Codekompression</i>. 2003.","ama":"Hoppe U. <i>Markovprozesse zur Modellierung bei Codekompression</i>.; 2003.","short":"U. Hoppe, Markovprozesse zur Modellierung bei Codekompression, 2003.","chicago":"Hoppe, Ulrich. <i>Markovprozesse zur Modellierung bei Codekompression</i>, 2003.","bibtex":"@book{Hoppe_2003, title={Markovprozesse zur Modellierung bei Codekompression}, author={Hoppe, Ulrich}, year={2003} }"},"file_date_updated":"2023-10-05T16:54:38Z","date_created":"2023-10-05T16:38:19Z","file":[{"date_updated":"2023-10-05T16:54:38Z","relation":"main_file","file_size":1902248,"access_level":"open_access","file_name":"2003_Hoppe_MarkowprozesseZurModellierungBeiCodekompression.ps","content_type":"application/postscript","file_id":"47724","creator":"bhenrik","date_created":"2023-10-05T16:38:12Z"}],"department":[{"_id":"34"},{"_id":"64"}],"oa":"1","type":"misc","keyword":["Diplomarbeit"],"author":[{"full_name":"Hoppe, Ulrich","first_name":"Ulrich","last_name":"Hoppe"}],"status":"public","title":"Markovprozesse zur Modellierung bei Codekompression","year":"2003","has_accepted_license":"1","date_updated":"2023-10-05T16:54:38Z","_id":"47696","language":[{"iso":"ger"}],"user_id":"41047","ddc":["000"]},{"language":[{"iso":"ger"}],"_id":"47636","user_id":"41047","ddc":["000"],"author":[{"last_name":"Unterkirchner","first_name":"Claudia","full_name":"Unterkirchner, Claudia"}],"year":"2003","status":"public","title":"Implementierung eines arithmetischen Dekodierers in Java","has_accepted_license":"1","date_updated":"2023-10-05T22:08:27Z","date_created":"2023-10-05T13:31:16Z","file":[{"content_type":"application/pdf","file_id":"47787","access_level":"open_access","file_size":809237,"file_name":"2003_Unterkircher_ImplementierungEinesArithmetischenDekodierersInJava.pdf","date_updated":"2023-10-05T22:08:27Z","relation":"main_file","date_created":"2023-10-05T22:03:44Z","creator":"bhenrik"}],"department":[{"_id":"34"},{"_id":"64"}],"oa":"1","type":"bachelorsthesis","citation":{"ieee":"C. Unterkirchner, <i>Implementierung eines arithmetischen Dekodierers in Java</i>. 2003.","apa":"Unterkirchner, C. (2003). <i>Implementierung eines arithmetischen Dekodierers in Java</i>.","short":"C. Unterkirchner, Implementierung eines arithmetischen Dekodierers in Java, 2003.","chicago":"Unterkirchner, Claudia. <i>Implementierung eines arithmetischen Dekodierers in Java</i>, 2003.","mla":"Unterkirchner, Claudia. <i>Implementierung eines arithmetischen Dekodierers in Java</i>. 2003.","bibtex":"@book{Unterkirchner_2003, title={Implementierung eines arithmetischen Dekodierers in Java}, author={Unterkirchner, Claudia}, year={2003} }","ama":"Unterkirchner C. <i>Implementierung eines arithmetischen Dekodierers in Java</i>.; 2003."},"file_date_updated":"2023-10-05T22:08:27Z"},{"_id":"47640","language":[{"iso":"ger"}],"user_id":"41047","ddc":["000"],"status":"public","title":"Tabellenbasierte arithmetische Codierung","year":"2003","author":[{"first_name":"Daniel","last_name":"Kuntze","full_name":"Kuntze, Daniel"}],"date_updated":"2023-10-05T22:08:52Z","has_accepted_license":"1","file":[{"creator":"bhenrik","date_created":"2023-10-05T22:04:08Z","access_level":"open_access","file_size":304544,"file_name":"2003_Kuntze_TabellenbasierteArithmetischeCodierung.pdf","date_updated":"2023-10-05T22:08:52Z","relation":"main_file","content_type":"application/pdf","file_id":"47788"}],"date_created":"2023-10-05T13:32:54Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","file_date_updated":"2023-10-05T22:08:52Z","citation":{"bibtex":"@book{Kuntze_2003, title={Tabellenbasierte arithmetische Codierung}, author={Kuntze, Daniel}, year={2003} }","ama":"Kuntze D. <i>Tabellenbasierte arithmetische Codierung</i>.; 2003.","mla":"Kuntze, Daniel. <i>Tabellenbasierte arithmetische Codierung</i>. 2003.","chicago":"Kuntze, Daniel. <i>Tabellenbasierte arithmetische Codierung</i>, 2003.","short":"D. Kuntze, Tabellenbasierte arithmetische Codierung, 2003.","ieee":"D. Kuntze, <i>Tabellenbasierte arithmetische Codierung</i>. 2003.","apa":"Kuntze, D. (2003). <i>Tabellenbasierte arithmetische Codierung</i>."}},{"date_created":"2023-10-05T13:32:10Z","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"citation":{"short":"C. Soltenborn, Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision, 2003.","chicago":"Soltenborn, Christian. <i>Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision</i>, 2003.","apa":"Soltenborn, C. (2003). <i>Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision</i>.","ieee":"C. Soltenborn, <i>Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision</i>. 2003.","ama":"Soltenborn C. <i>Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision</i>.; 2003.","bibtex":"@book{Soltenborn_2003, title={Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision}, author={Soltenborn, Christian}, year={2003} }","mla":"Soltenborn, Christian. <i>Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision</i>. 2003."},"language":[{"iso":"ger"}],"_id":"47638","user_id":"41047","year":"2003","title":"Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision","status":"public","author":[{"first_name":"Christian","last_name":"Soltenborn","full_name":"Soltenborn, Christian"}],"date_updated":"2023-10-05T13:39:29Z"},{"_id":"47637","language":[{"iso":"ger"}],"user_id":"41047","author":[{"first_name":"Christian","last_name":"Todtenbier","full_name":"Todtenbier, Christian"}],"title":"Implementierung eines arithmetischen Kodierers in Java","status":"public","year":"2003","date_updated":"2023-10-05T13:39:26Z","date_created":"2023-10-05T13:31:45Z","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","citation":{"bibtex":"@book{Todtenbier_2003, title={Implementierung eines arithmetischen Kodierers in Java}, author={Todtenbier, Christian}, year={2003} }","ama":"Todtenbier C. <i>Implementierung eines arithmetischen Kodierers in Java</i>.; 2003.","mla":"Todtenbier, Christian. <i>Implementierung eines arithmetischen Kodierers in Java</i>. 2003.","short":"C. Todtenbier, Implementierung eines arithmetischen Kodierers in Java, 2003.","chicago":"Todtenbier, Christian. <i>Implementierung eines arithmetischen Kodierers in Java</i>, 2003.","ieee":"C. Todtenbier, <i>Implementierung eines arithmetischen Kodierers in Java</i>. 2003.","apa":"Todtenbier, C. (2003). <i>Implementierung eines arithmetischen Kodierers in Java</i>."}},{"type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"64"}],"date_created":"2023-10-05T13:30:15Z","citation":{"ieee":"M. Ziegler, <i>Fehlerangriffe auf spezielle Implementierungen von RSA</i>. 2003.","apa":"Ziegler, M. (2003). <i>Fehlerangriffe auf spezielle Implementierungen von RSA</i>.","mla":"Ziegler, Max. <i>Fehlerangriffe Auf Spezielle Implementierungen von RSA</i>. 2003.","bibtex":"@book{Ziegler_2003, title={Fehlerangriffe auf spezielle Implementierungen von RSA}, author={Ziegler, Max}, year={2003} }","ama":"Ziegler M. <i>Fehlerangriffe Auf Spezielle Implementierungen von RSA</i>.; 2003.","short":"M. Ziegler, Fehlerangriffe Auf Spezielle Implementierungen von RSA, 2003.","chicago":"Ziegler, Max. <i>Fehlerangriffe Auf Spezielle Implementierungen von RSA</i>, 2003."},"user_id":"41047","language":[{"iso":"eng"}],"_id":"47634","date_updated":"2023-10-05T13:39:11Z","title":"Fehlerangriffe auf spezielle Implementierungen von RSA","year":"2003","status":"public","author":[{"full_name":"Ziegler, Max","last_name":"Ziegler","first_name":"Max"}]},{"citation":{"mla":"Lindner, Marvin. <i>Verkürzte Huffman-Codierung zur Codekompression</i>. 2003.","bibtex":"@book{Lindner_2003, title={Verkürzte Huffman-Codierung zur Codekompression}, author={Lindner, Marvin}, year={2003} }","ama":"Lindner M. <i>Verkürzte Huffman-Codierung zur Codekompression</i>.; 2003.","ieee":"M. Lindner, <i>Verkürzte Huffman-Codierung zur Codekompression</i>. 2003.","apa":"Lindner, M. (2003). <i>Verkürzte Huffman-Codierung zur Codekompression</i>.","short":"M. Lindner, Verkürzte Huffman-Codierung zur Codekompression, 2003.","chicago":"Lindner, Marvin. <i>Verkürzte Huffman-Codierung zur Codekompression</i>, 2003."},"date_created":"2023-10-05T13:32:32Z","department":[{"_id":"34"},{"_id":"64"}],"type":"bachelorsthesis","author":[{"full_name":"Lindner, Marvin","last_name":"Lindner","first_name":"Marvin"}],"title":"Verkürzte Huffman-Codierung zur Codekompression","year":"2003","status":"public","date_updated":"2023-10-05T13:42:10Z","language":[{"iso":"ger"}],"_id":"47639","user_id":"41047"},{"user_id":"41047","ddc":["000"],"_id":"47695","language":[{"iso":"ger"}],"date_updated":"2023-10-05T16:54:32Z","has_accepted_license":"1","status":"public","title":"Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten","year":"2003","author":[{"full_name":"Ackermann, Marcel R.","last_name":"Ackermann","first_name":"Marcel R."}],"keyword":["Diplomarbeit"],"type":"misc","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","file":[{"file_name":"2003_Ackermann_TabellenbasierteArithmetischeKodierungBeiAllgemeinenAlphabeten.ps","file_size":8764824,"access_level":"open_access","relation":"main_file","date_updated":"2023-10-05T16:54:32Z","file_id":"47722","content_type":"application/postscript","creator":"bhenrik","date_created":"2023-10-05T16:37:41Z"}],"date_created":"2023-10-05T16:37:47Z","file_date_updated":"2023-10-05T16:54:32Z","citation":{"apa":"Ackermann, M. R. (2003). <i>Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten</i>.","ieee":"M. R. Ackermann, <i>Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten</i>. 2003.","short":"M.R. Ackermann, Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten, 2003.","chicago":"Ackermann, Marcel R. <i>Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten</i>, 2003.","mla":"Ackermann, Marcel R. <i>Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten</i>. 2003.","ama":"Ackermann MR. <i>Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten</i>.; 2003.","bibtex":"@book{Ackermann_2003, title={Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten}, author={Ackermann, Marcel R.}, year={2003} }"}},{"user_id":"25078","ddc":["000"],"volume":42,"page":"1737-1744","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"3034","has_accepted_license":"1","status":"public","file_date_updated":"2018-06-05T08:37:48Z","citation":{"short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.","chicago":"Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i> 42, no. 6 (2002): 1737–44. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>.","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, pp. 1737–1744, 2002.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>, <i>42</i>(6), 1737–1744. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>","bibtex":"@article{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, volume={42}, DOI={<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>}, number={6}, journal={IEEE Transactions on Information Theory}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}, year={2002}, pages={1737–1744} }","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>. 2002;42(6):1737-1744. doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>","mla":"Albanese, Andres, et al. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>."},"doi":"10.1109/18.556670","publication_status":"published","date_updated":"2022-01-06T06:58:53Z","intvolume":"        42","year":"2002","title":"Priority encoding transmission","publication_identifier":{"issn":["0018-9448"]},"author":[{"last_name":"Albanese","first_name":"Andres","full_name":"Albanese, Andres"},{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Edmonds, Jeff","first_name":"Jeff","last_name":"Edmonds"},{"first_name":"Michael","last_name":"Luby","full_name":"Luby, Michael"},{"full_name":"Sudan, Madhu","last_name":"Sudan","first_name":"Madhu"}],"type":"journal_article","department":[{"_id":"64"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"3035","access_level":"closed","file_size":260143,"file_name":"pet.pdf","date_updated":"2018-06-05T08:37:48Z","relation":"main_file","date_created":"2018-06-05T08:37:48Z","creator":"feidens"}],"date_created":"2018-06-05T08:36:14Z","extern":"1","publication":"IEEE Transactions on Information Theory","issue":"6"},{"extern":"1","citation":{"ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, 2002.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>","mla":"Albanese, A., et al. “Priority Encoding Transmission.” <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>.","bibtex":"@inproceedings{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>}, booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}, year={2002} }","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>","chicago":"Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>."},"publication":"Proceedings 35th Annual Symposium on Foundations of Computer Science","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T08:43:13Z","date_updated":"2022-01-06T06:58:53Z","publication_status":"published","author":[{"full_name":"Albanese, A.","last_name":"Albanese","first_name":"A."},{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"full_name":"Edmonds, J.","last_name":"Edmonds","first_name":"J."},{"full_name":"Luby, M.","first_name":"M.","last_name":"Luby"},{"first_name":"M.","last_name":"Sudan","full_name":"Sudan, M."}],"publication_identifier":{"isbn":["0818665807"]},"status":"public","title":"Priority encoding transmission","year":"2002","doi":"10.1109/sfcs.1994.365731","user_id":"25078","_id":"3040","publisher":"IEEE Comput. Soc. Press"},{"date_updated":"2023-01-10T13:49:25Z","publication_status":"published","publication_identifier":{"isbn":["0818624450"]},"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"title":"Computing sums of radicals in polynomial time","year":"2002","doi":"10.1109/sfcs.1991.185434","extern":"1","publication":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T08:44:18Z","file":[{"date_created":"2018-06-05T08:45:15Z","creator":"feidens","content_type":"application/pdf","success":1,"file_id":"3042","date_updated":"2018-06-05T08:45:15Z","relation":"main_file","file_size":335754,"access_level":"closed","file_name":"ComputingSumsOfRadicals_01.pdf"}],"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"25078","publisher":"IEEE Comput. Soc. Press","_id":"3041","citation":{"mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","ama":"Blömer J. Computing sums of radicals in polynomial time. In: <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>","bibtex":"@inproceedings{Blömer_2002, title={Computing sums of radicals in polynomial time}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>}, booktitle={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={2002} }","apa":"Blömer, J. (2002). Computing sums of radicals in polynomial time. <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>","ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","short":"J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>."},"file_date_updated":"2018-06-05T08:45:15Z"},{"volume":28,"user_id":"23","publisher":"Springer Science and Business Media LLC","_id":"35857","page":"2-15","status":"public","citation":{"bibtex":"@article{Blömer_2002, title={Denesting by Bounded Degree Radicals}, volume={28}, DOI={<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>}, number={1}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Blömer, J.}, year={2002}, pages={2–15} }","ama":"Blömer J. Denesting by Bounded Degree Radicals. <i>Algorithmica</i>. 2002;28(1):2-15. doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>","mla":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i>, vol. 28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","chicago":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i> 28, no. 1 (2002): 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>.","short":"J. Blömer, Algorithmica 28 (2002) 2–15.","ieee":"J. Blömer, “Denesting by Bounded Degree Radicals,” <i>Algorithmica</i>, vol. 28, no. 1, pp. 2–15, 2002, doi: <a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","apa":"Blömer, J. (2002). Denesting by Bounded Degree Radicals. <i>Algorithmica</i>, <i>28</i>(1), 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>"},"doi":"10.1007/s004530010028","language":[{"iso":"eng"}],"intvolume":"        28","publication_status":"published","date_updated":"2023-01-10T13:48:53Z","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Blömer, J.","first_name":"J.","last_name":"Blömer"}],"title":"Denesting by Bounded Degree Radicals","year":"2002","department":[{"_id":"64"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","date_created":"2023-01-10T13:44:28Z","publication":"Algorithmica","issue":"1"},{"has_accepted_license":"1","date_updated":"2023-10-05T16:54:44Z","author":[{"full_name":"Fricke, Birgitta","first_name":"Birgitta","last_name":"Fricke"}],"year":"2002","status":"public","title":"Construction of Pseudorandom Functions","user_id":"41047","ddc":["000"],"language":[{"iso":"eng"}],"_id":"47698","citation":{"apa":"Fricke, B. (2002). <i>Construction of Pseudorandom Functions</i>.","ieee":"B. Fricke, <i>Construction of Pseudorandom Functions</i>. 2002.","short":"B. Fricke, Construction of Pseudorandom Functions, 2002.","chicago":"Fricke, Birgitta. <i>Construction of Pseudorandom Functions</i>, 2002.","mla":"Fricke, Birgitta. <i>Construction of Pseudorandom Functions</i>. 2002.","ama":"Fricke B. <i>Construction of Pseudorandom Functions</i>.; 2002.","bibtex":"@book{Fricke_2002, title={Construction of Pseudorandom Functions}, author={Fricke, Birgitta}, year={2002} }"},"file_date_updated":"2023-10-05T16:54:44Z","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","keyword":["Diplomarbeit"],"type":"misc","date_created":"2023-10-05T16:39:34Z","file":[{"date_created":"2023-10-05T16:39:26Z","creator":"bhenrik","file_id":"47726","content_type":"application/postscript","relation":"main_file","date_updated":"2023-10-05T16:54:44Z","file_name":"2002_Fricke_Pseudorandom.ps","access_level":"open_access","file_size":3696785}]},{"user_id":"41047","_id":"47697","language":[{"iso":"ger"}],"date_updated":"2023-10-05T16:42:39Z","title":"Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems","status":"public","year":"2002","author":[{"first_name":"Deniz","last_name":"Deveci","full_name":"Deveci, Deniz"}],"type":"misc","keyword":["Diplomarbeit"],"department":[{"_id":"34"},{"_id":"64"}],"date_created":"2023-10-05T16:38:45Z","citation":{"ama":"Deveci D. <i>Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems</i>.; 2002.","bibtex":"@book{Deveci_2002, title={Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems}, author={Deveci, Deniz}, year={2002} }","mla":"Deveci, Deniz. <i>Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems</i>. 2002.","short":"D. Deveci, Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems, 2002.","chicago":"Deveci, Deniz. <i>Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems</i>, 2002.","apa":"Deveci, D. (2002). <i>Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems</i>.","ieee":"D. Deveci, <i>Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems</i>. 2002."}},{"citation":{"ama":"Helbich A. <i>The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography</i>.; 2002.","bibtex":"@book{Helbich_2002, title={The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography}, author={Helbich, Anke}, year={2002} }","mla":"Helbich, Anke. <i>The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography</i>. 2002.","short":"A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.","chicago":"Helbich, Anke. <i>The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography</i>, 2002.","apa":"Helbich, A. (2002). <i>The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography</i>.","ieee":"A. Helbich, <i>The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography</i>. 2002."},"date_created":"2023-10-05T16:40:05Z","department":[{"_id":"34"},{"_id":"64"}],"type":"misc","keyword":["Diplomarbeit"],"author":[{"last_name":"Helbich","first_name":"Anke","full_name":"Helbich, Anke"}],"title":"The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography","year":"2002","status":"public","date_updated":"2023-10-05T16:42:35Z","_id":"47699","language":[{"iso":"eng"}],"user_id":"41047"},{"citation":{"mla":"Schepers, Daniel. <i>Timing Attacks for Cryptosystems Based on Elliptic Curves</i>. 2002.","ama":"Schepers D. <i>Timing Attacks for Cryptosystems Based on Elliptic Curves</i>.; 2002.","bibtex":"@book{Schepers_2002, title={Timing Attacks for Cryptosystems based on Elliptic Curves}, author={Schepers, Daniel}, year={2002} }","apa":"Schepers, D. (2002). <i>Timing Attacks for Cryptosystems based on Elliptic Curves</i>.","ieee":"D. Schepers, <i>Timing Attacks for Cryptosystems based on Elliptic Curves</i>. 2002.","chicago":"Schepers, Daniel. <i>Timing Attacks for Cryptosystems Based on Elliptic Curves</i>, 2002.","short":"D. Schepers, Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002."},"date_created":"2023-10-05T16:41:01Z","keyword":["Diplomarbeit"],"type":"misc","department":[{"_id":"34"},{"_id":"64"}],"title":"Timing Attacks for Cryptosystems based on Elliptic Curves","year":"2002","status":"public","author":[{"full_name":"Schepers, Daniel","last_name":"Schepers","first_name":"Daniel"}],"date_updated":"2023-10-05T16:42:34Z","language":[{"iso":"eng"}],"_id":"47700","user_id":"41047"},{"has_accepted_license":"1","date_updated":"2023-10-05T22:03:17Z","author":[{"full_name":"Hoppe, Ulrich","first_name":"Ulrich","last_name":"Hoppe"}],"title":"Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen","year":"2002","status":"public","user_id":"41047","ddc":["000"],"language":[{"iso":"ger"}],"_id":"47633","citation":{"mla":"Hoppe, Ulrich. <i>Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen</i>. 2002.","bibtex":"@book{Hoppe_2002, title={Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen}, author={Hoppe, Ulrich}, year={2002} }","ama":"Hoppe U. <i>Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen</i>.; 2002.","ieee":"U. Hoppe, <i>Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen</i>. 2002.","apa":"Hoppe, U. (2002). <i>Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen</i>.","chicago":"Hoppe, Ulrich. <i>Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen</i>, 2002.","short":"U. Hoppe, Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002."},"file_date_updated":"2023-10-05T22:02:59Z","department":[{"_id":"34"},{"_id":"64"}],"oa":"1","type":"bachelorsthesis","date_created":"2023-10-05T13:29:41Z","file":[{"content_type":"application/postscript","file_id":"47786","date_updated":"2023-10-05T22:02:59Z","relation":"main_file","access_level":"open_access","file_size":361052,"file_name":"2002_Hoppe_MDS-Codes.ps","date_created":"2023-10-05T22:02:59Z","creator":"bhenrik"}]}]