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