[{"title":"Turing und Kryptografie","doi":"10.1007/s00287-012-0622-7","date_updated":"2022-01-06T06:58:50Z","volume":35,"date_created":"2018-06-05T07:42:38Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"year":"2012","intvolume":"        35","citation":{"apa":"Blömer, J. (2012). Turing und Kryptografie. <i>Informatik-Spektrum</i>, <i>35</i>(4). <a href=\"https://doi.org/10.1007/s00287-012-0622-7\">https://doi.org/10.1007/s00287-012-0622-7</a>","mla":"Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>, vol. 35, no. 4, 2012, doi:<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>.","short":"J. Blömer, Informatik-Spektrum 35 (2012).","bibtex":"@article{Blömer_2012, title={Turing und Kryptografie}, volume={35}, DOI={<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>}, number={4}, journal={Informatik-Spektrum}, author={Blömer, Johannes}, year={2012} }","ama":"Blömer J. Turing und Kryptografie. <i>Informatik-Spektrum</i>. 2012;35(4). doi:<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>","chicago":"Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i> 35, no. 4 (2012). <a href=\"https://doi.org/10.1007/s00287-012-0622-7\">https://doi.org/10.1007/s00287-012-0622-7</a>.","ieee":"J. Blömer, “Turing und Kryptografie,” <i>Informatik-Spektrum</i>, vol. 35, no. 4, 2012."},"publication_identifier":{"issn":["1432-122X"]},"quality_controlled":"1","publication_status":"published","issue":"4","language":[{"iso":"eng"}],"_id":"2984","department":[{"_id":"64"}],"user_id":"25078","abstract":[{"lang":"eng","text":"Ich beschreibe die deutsche Enigma-Verschlüsselungsmaschine und skizziere, wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde. Besonderes Augenmerk lege ich auf die Beiträge Alan Turings und die Bedeutung seiner Leistung für die Entwicklung moderner Kryptografie. "}],"status":"public","publication":"Informatik-Spektrum","type":"journal_article"},{"status":"public","type":"conference","_id":"2985","department":[{"_id":"64"}],"series_title":"Electronic Colloquium on Computational Complexity (ECCC)","user_id":"25078","year":"2011","citation":{"mla":"Ackermann, Marcel R., et al. <i>Hardness and Non-Approximability of Bregman Clustering Problems.</i> 2011.","bibtex":"@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity (ECCC)} }","short":"M.R. Ackermann, J. Blömer, C. Scholz, (2011).","apa":"Ackermann, M. R., Blömer, J., &#38; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.","ama":"Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.","chicago":"Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.","ieee":"M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011."},"publication_status":"published","title":"Hardness and Non-Approximability of Bregman Clustering Problems.","date_updated":"2022-01-06T06:58:50Z","author":[{"first_name":"Marcel R","full_name":"Ackermann, Marcel R","last_name":"Ackermann"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Christoph","full_name":"Scholz, Christoph","last_name":"Scholz"}],"date_created":"2018-06-05T07:47:21Z"},{"publication":"Algorithms Unplugged","type":"book_chapter","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"2986","publication_identifier":{"isbn":["9783642153273","9783642153280"]},"publication_status":"published","page":"159-168","citation":{"ieee":"J. Blömer, “How to Share a Secret,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.","chicago":"Blömer, Johannes. “How to Share a Secret.” In <i>Algorithms Unplugged</i>, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>.","ama":"Blömer J. How to Share a Secret. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>","apa":"Blömer, J. (2011). How to Share a Secret. In <i>Algorithms Unplugged</i> (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>","mla":"Blömer, Johannes. “How to Share a Secret.” <i>Algorithms Unplugged</i>, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>.","bibtex":"@inbook{Blömer_2011, place={Berlin, Heidelberg}, title={How to Share a Secret}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>}, booktitle={Algorithms Unplugged}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2011}, pages={159–168} }","short":"J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168."},"year":"2011","place":"Berlin, Heidelberg","date_created":"2018-06-05T07:48:25Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-642-15328-0_17","title":"How to Share a Secret"},{"department":[{"_id":"64"}],"series_title":"Lecture Notes in Computer Science","user_id":"25078","_id":"2988","status":"public","publication":"SWAT 2010","type":"book_chapter","doi":"10.1007/978-3-642-13731-0_21","title":"Bregman Clustering for Separable Instances","date_created":"2018-06-05T07:51:51Z","author":[{"last_name":"Ackermann","full_name":"Ackermann, Marcel R.","first_name":"Marcel R."},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z","page":"212-223","citation":{"bibtex":"@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Bregman Clustering for Separable Instances}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>}, booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture Notes in Computer Science} }","short":"M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.","mla":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” <i>SWAT 2010</i>, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>.","apa":"Ackermann, M. R., &#38; Blömer, J. (2010). Bregman Clustering for Separable Instances. In <i>SWAT 2010</i> (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">https://doi.org/10.1007/978-3-642-13731-0_21</a>","ama":"Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: <i>SWAT 2010</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:<a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">10.1007/978-3-642-13731-0_21</a>","ieee":"M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in <i>SWAT 2010</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.","chicago":"Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” In <i>SWAT 2010</i>, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13731-0_21\">https://doi.org/10.1007/978-3-642-13731-0_21</a>."},"year":"2010","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783642137303","9783642137310"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"title":"Clustering for Metric and Nonmetric Distance Measures","doi":"10.1145/1824777.1824779","date_updated":"2022-01-06T06:58:50Z","author":[{"first_name":"Marcel R.","last_name":"Ackermann","full_name":"Ackermann, Marcel R."},{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_created":"2018-06-05T07:52:41Z","year":"2010","page":"59:1--59:26","citation":{"ama":"Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. <i>ACM Trans Algorithms</i>. 2010;(4):59:1--59:26. doi:<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>","chicago":"Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” <i>ACM Trans. Algorithms</i>, no. 4 (2010): 59:1--59:26. <a href=\"https://doi.org/10.1145/1824777.1824779\">https://doi.org/10.1145/1824777.1824779</a>.","ieee":"M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” <i>ACM Trans. Algorithms</i>, no. 4, pp. 59:1--59:26, 2010.","mla":"Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.” <i>ACM Trans. Algorithms</i>, no. 4, 2010, pp. 59:1--59:26, doi:<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>.","bibtex":"@article{Ackermann_Blömer_Sohler_2010, title={Clustering for Metric and Nonmetric Distance Measures}, DOI={<a href=\"https://doi.org/10.1145/1824777.1824779\">10.1145/1824777.1824779</a>}, number={4}, journal={ACM Trans. Algorithms}, author={Ackermann, Marcel R. and Blömer, Johannes and Sohler, Christian}, year={2010}, pages={59:1--59:26} }","short":"M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.","apa":"Ackermann, M. R., Blömer, J., &#38; Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. <i>ACM Trans. Algorithms</i>, (4), 59:1--59:26. <a href=\"https://doi.org/10.1145/1824777.1824779\">https://doi.org/10.1145/1824777.1824779</a>"},"publication_identifier":{"issn":["1549-6325"]},"publication_status":"published","issue":"4","keyword":["k-means clustering","k-median clustering","Approximation algorithm","Bregman divergences","Itakura-Saito divergence","Kullback-Leibler divergence","Mahalanobis distance","random sampling"],"_id":"2990","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"ACM Trans. Algorithms","type":"journal_article"},{"user_id":"25078","department":[{"_id":"64"}],"_id":"2991","type":"journal_article","publication":"Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany","status":"public","author":[{"first_name":"Alexander","last_name":"Krueger","full_name":"Krueger, Alexander"},{"full_name":"Leutnant, Volker","last_name":"Leutnant","first_name":"Volker"},{"full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"},{"last_name":"Ackermann","full_name":"Ackermann, Marcel","first_name":"Marcel"},{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_created":"2018-06-05T07:53:41Z","date_updated":"2022-01-06T06:58:50Z","title":"On the initialization of dynamic models for speech features","publication_status":"published","citation":{"ieee":"A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>, 2010.","chicago":"Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>, 2010.","ama":"Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. On the initialization of dynamic models for speech features. <i>Proc of ITG Fachtagung Sprachkommunikation ITG, Bochum, Germany</i>. 2010.","mla":"Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>, 2010.","bibtex":"@article{Krueger_Leutnant_Haeb-Umbach_Ackermann_Blömer_2010, title={On the initialization of dynamic models for speech features}, journal={Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany}, author={Krueger, Alexander and Leutnant, Volker and Haeb-Umbach, Reinhold and Ackermann, Marcel and Blömer, Johannes}, year={2010} }","short":"A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010).","apa":"Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., &#38; Blömer, J. (2010). On the initialization of dynamic models for speech features. <i>Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany</i>."},"year":"2010"},{"date_updated":"2022-01-06T06:58:50Z","publisher":"ACM Press","date_created":"2018-06-05T08:03:49Z","author":[{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"},{"first_name":"Ansgar","last_name":"Trächtler","full_name":"Trächtler, Ansgar"},{"last_name":"Birattari","full_name":"Birattari, Mauro","first_name":"Mauro"},{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"},{"first_name":"Rehan","full_name":"O'Grady, Rehan","last_name":"O'Grady"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"first_name":"Franz","last_name":"Rammig","full_name":"Rammig, Franz"},{"last_name":"Reif","full_name":"Reif, Wolfgang","first_name":"Wolfgang"}],"title":"Engineering self-coordinating software intensive systems","doi":"10.1145/1882362.1882428","publication_identifier":{"isbn":["9781450304276"]},"publication_status":"published","year":"2010","citation":{"apa":"Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In <i>Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10</i>. ACM Press. <a href=\"https://doi.org/10.1145/1882362.1882428\">https://doi.org/10.1145/1882362.1882428</a>","mla":"Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.” <i>Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10</i>, ACM Press, 2010, doi:<a href=\"https://doi.org/10.1145/1882362.1882428\">10.1145/1882362.1882428</a>.","short":"W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels, R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.","bibtex":"@inproceedings{Schäfer_Trächtler_Birattari_Blömer_Dorigo_Engels_O’Grady_Platzner_Rammig_Reif_2010, title={Engineering self-coordinating software intensive systems}, DOI={<a href=\"https://doi.org/10.1145/1882362.1882428\">10.1145/1882362.1882428</a>}, booktitle={Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10}, publisher={ACM Press}, author={Schäfer, Wilhelm and Trächtler, Ansgar and Birattari, Mauro and Blömer, Johannes and Dorigo, Marco and Engels, Gregor and O’Grady, Rehan and Platzner, Marco and Rammig, Franz and Reif, Wolfgang}, year={2010} }","chicago":"Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.” In <i>Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10</i>. ACM Press, 2010. <a href=\"https://doi.org/10.1145/1882362.1882428\">https://doi.org/10.1145/1882362.1882428</a>.","ieee":"W. Schäfer <i>et al.</i>, “Engineering self-coordinating software intensive systems,” in <i>Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10</i>, 2010.","ama":"Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating software intensive systems. In: <i>Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10</i>. ACM Press; 2010. doi:<a href=\"https://doi.org/10.1145/1882362.1882428\">10.1145/1882362.1882428</a>"},"_id":"2994","department":[{"_id":"64"}],"user_id":"25078","publication":"Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER '10","type":"conference","status":"public"},{"title":"Coresets and Approximate Clustering for Bregman Divergences","doi":"10.1137/1.9781611973068.118","date_updated":"2022-01-06T06:58:50Z","publisher":"Society for Industrial and Applied Mathematics","author":[{"first_name":"Marcel R.","last_name":"Ackermann","full_name":"Ackermann, Marcel R."},{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-06-05T08:05:17Z","year":"2009","place":"Philadelphia, PA","page":"1088-1097","citation":{"chicago":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>.","ieee":"M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.","ama":"Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences. In: <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097. doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>","mla":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>.","bibtex":"@inbook{Ackermann_Blömer_2009, place={Philadelphia, PA}, title={Coresets and Approximate Clustering for Bregman Divergences}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>}, booktitle={Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher={Society for Industrial and Applied Mathematics}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2009}, pages={1088–1097} }","short":"M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.","apa":"Ackermann, M. R., &#38; Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>"},"publication_identifier":{"isbn":["9780898716801","9781611973068"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"2995","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","type":"book_chapter"},{"status":"public","publication":"Theoretical Computer Science","type":"journal_article","keyword":["Geometry of numbers","Lattices","Shortest vectors"],"language":[{"iso":"eng"}],"_id":"2999","department":[{"_id":"64"}],"user_id":"49063","year":"2009","intvolume":"       410","page":"1648 - 1665","citation":{"apa":"Blömer, J., &#38;  Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>, <i>410</i>(18), 1648–1665. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>","bibtex":"@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors, closest vectors and successive minima}, volume={410}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>}, number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes and  Naewe, Stefanie}, year={2009}, pages={1648–1665} }","short":"J. Blömer, S.  Naewe, Theoretical Computer Science 410 (2009) 1648–1665.","mla":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>, vol. 410, no. 18, 2009, pp. 1648–65, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","ama":"Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. <i>Theoretical Computer Science</i>. 2009;410(18):1648-1665. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>","ieee":"J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” <i>Theoretical Computer Science</i>, vol. 410, no. 18, pp. 1648–1665, 2009, doi: <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">10.1016/j.tcs.2008.12.045</a>.","chicago":"Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i> 410, no. 18 (2009): 1648–65. <a href=\"https://doi.org/10.1016/j.tcs.2008.12.045\">https://doi.org/10.1016/j.tcs.2008.12.045</a>."},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","issue":"18","title":"Sampling methods for shortest vectors, closest vectors and successive minima","doi":"10.1016/j.tcs.2008.12.045","date_updated":"2024-08-08T12:18:04Z","volume":410,"date_created":"2018-06-05T08:07:24Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"full_name":" Naewe, Stefanie","id":"1971","last_name":" Naewe","first_name":"Stefanie"}]},{"status":"public","type":"book_chapter","publication":"Selected Areas in Cryptography","user_id":"25078","department":[{"_id":"64"}],"_id":"3002","citation":{"apa":"Blömer, J., &#38; Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In <i>Selected Areas in Cryptography</i> (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-77360-3_7\">https://doi.org/10.1007/978-3-540-77360-3_7</a>","mla":"Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2007, pp. 96–109, doi:<a href=\"https://doi.org/10.1007/978-3-540-77360-3_7\">10.1007/978-3-540-77360-3_7</a>.","short":"J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.","bibtex":"@inbook{Blömer_Krummel_2007, place={Berlin, Heidelberg}, title={Analysis of Countermeasures Against Access Driven Cache Attacks on AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-77360-3_7\">10.1007/978-3-540-77360-3_7</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2007}, pages={96–109} }","ama":"Blömer J, Krummel V. Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:96-109. doi:<a href=\"https://doi.org/10.1007/978-3-540-77360-3_7\">10.1007/978-3-540-77360-3_7</a>","chicago":"Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” In <i>Selected Areas in Cryptography</i>, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-77360-3_7\">https://doi.org/10.1007/978-3-540-77360-3_7</a>.","ieee":"J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109."},"page":"96-109","year":"2007","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540773597"]},"main_file_link":[{"url":"https://eprint.iacr.org/2007/282","open_access":"1"}],"doi":"10.1007/978-3-540-77360-3_7","title":"Analysis of Countermeasures Against Access Driven Cache Attacks on AES","date_created":"2018-06-05T08:12:18Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Volker","last_name":"Krummel","full_name":"Krummel, Volker"}],"date_updated":"2022-01-06T06:58:50Z","oa":"1","publisher":"Springer Berlin Heidelberg"},{"_id":"3020","user_id":"25078","department":[{"_id":"64"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","title":"Low Secret Exponent RSA Revisited","doi":"10.1007/3-540-44670-2_2","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","date_created":"2018-06-05T08:26:29Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"place":"Berlin, Heidelberg","year":"2007","citation":{"apa":"Blömer, J., &#38; May, A. (2007). Low Secret Exponent RSA Revisited. In <i>Lecture Notes in Computer Science</i> (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>","mla":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>.","short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret Exponent RSA Revisited}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }","chicago":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In <i>Lecture Notes in Computer Science</i>, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>.","ieee":"J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.","ama":"Blömer J, May A. Low Secret Exponent RSA Revisited. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>"},"page":"4-19","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424888","9783540446705"]}},{"user_id":"25078","department":[{"_id":"64"}],"_id":"3021","status":"public","type":"book_chapter","publication":"Selected Areas in Cryptography","doi":"10.1007/3-540-45537-x_26","title":"Key Revocation with Interval Cover Families","date_created":"2018-06-05T08:26:50Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","citation":{"apa":"Blömer, J., &#38; May, A. (2007). Key Revocation with Interval Cover Families. In <i>Selected Areas in Cryptography</i> (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45537-x_26\">https://doi.org/10.1007/3-540-45537-x_26</a>","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation with Interval Cover Families}, DOI={<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }","mla":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>.","short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.","chicago":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In <i>Selected Areas in Cryptography</i>, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-45537-x_26\">https://doi.org/10.1007/3-540-45537-x_26</a>.","ieee":"J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.","ama":"Blömer J, May A. Key Revocation with Interval Cover Families. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>"},"page":"325-341","year":"2007","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540430667","9783540455370"],"issn":["0302-9743"]}},{"title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","doi":"10.1007/3-540-68530-8_13","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:28:39Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"place":"Berlin, Heidelberg","year":"2007","page":"151-162","citation":{"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>","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} }","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>.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.","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>","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.","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>."},"publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"publication_status":"published","_id":"3026","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Algorithms — ESA’ 98","type":"book_chapter"},{"language":[{"iso":"eng"}],"_id":"55571","department":[{"_id":"64"}],"series_title":"Lecture notes in Computer Science. Invited to Theoretical Computer Science","user_id":"49063","status":"public","publication":"Proceedings of the 34th ICALP","type":"conference","title":"Sampling methods for shortest vectors, closest vectors and successive minima","publisher":"Springer Verlag","date_updated":"2024-08-08T12:14:09Z","volume":4596,"date_created":"2024-08-08T12:14:05Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Stefanie","last_name":" Naewe","full_name":" Naewe, Stefanie","id":"1971"}],"year":"2007","page":"65-77","intvolume":"      4596","citation":{"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.","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.","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.","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} }","short":"J. Blömer, S.  Naewe, in: Proceedings of the 34th ICALP, Springer Verlag, 2007, pp. 65–77."},"publication_status":"published"},{"year":"2006","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>","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} }","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>.","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>.","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>"},"page":"654--671","publication_status":"published","issue":"6","title":"Randomness and Secrecy - A Brief Introduction","doi":"10.3217/jucs-012-06-0654","date_updated":"2022-01-06T06:58:50Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"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."}],"status":"public","type":"journal_article","publication":"Journal of Universal Computer Science (J.UCS)","_id":"3003","user_id":"25078","department":[{"_id":"64"}]},{"publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"106-120","citation":{"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>","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","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} }","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>.","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>.","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."},"place":"Berlin, Heidelberg","year":"2006","date_created":"2018-06-05T08:14:42Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/11889700_11","title":"Fault Based Collision Attacks on AES","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"3004"},{"author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"date_created":"2018-06-05T08:15:48Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z","doi":"10.1007/11889700_2","title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"13-23","citation":{"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} }","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>.","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>","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>","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>."},"year":"2006","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"user_id":"25078","_id":"3005","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public"},{"date_created":"2018-06-05T08:17:12Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Martin","full_name":"Otto, Martin","last_name":"Otto"},{"first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre","last_name":"Seifert"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/11889700_4","title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"publication_status":"published","page":"36-52","citation":{"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>","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.","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} }","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>.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","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>"},"year":"2006","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"user_id":"25078","_id":"3007","file_date_updated":"2018-06-05T08:18:56Z","ddc":["000"],"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-06-05T08:18:56Z","creator":"feidens","date_created":"2018-06-05T08:18:56Z","file_size":259146,"file_name":"SignChangeFaultAttacksOnECC.pdf","access_level":"closed","file_id":"3009"}]},{"ddc":["000"],"file":[{"file_size":333655,"access_level":"closed","file_name":"toolkit.pdf","file_id":"3008","date_updated":"2018-06-05T08:18:20Z","date_created":"2018-06-05T08:18:20Z","creator":"feidens","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"EUROCRYPT 2005","title":"A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers","date_created":"2018-06-05T08:16:47Z","publisher":"Springer Berlin Heidelberg","year":"2005","file_date_updated":"2018-06-05T08:18:20Z","user_id":"25078","series_title":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"_id":"3006","status":"public","type":"book_chapter","doi":"10.1007/11426639_15","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"date_updated":"2022-01-06T06:58:50Z","citation":{"mla":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>.","bibtex":"@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }","short":"J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.","apa":"Blömer, J., &#38; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In <i>EUROCRYPT 2005</i> (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>","chicago":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In <i>EUROCRYPT 2005</i>, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>.","ieee":"J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.","ama":"Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: <i>EUROCRYPT 2005</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>"},"page":"251-267","place":"Berlin, Heidelberg","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]}},{"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"last_name":"Guajardo","full_name":"Guajardo, Jorge","first_name":"Jorge"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"}],"date_created":"2018-06-05T08:20:20Z","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-540-30564-4_5","title":"Provably Secure Masking of AES","publication_identifier":{"isbn":["9783540243274","9783540305644"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"69-83","citation":{"ama":"Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>","chicago":"Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In <i>Selected Areas in Cryptography</i>, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>.","ieee":"J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.","apa":"Blömer, J., Guajardo, J., &#38; Krummel, V. (2004). Provably Secure Masking of AES. In <i>Selected Areas in Cryptography</i> (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">https://doi.org/10.1007/978-3-540-30564-4_5</a>","mla":"Blömer, Johannes, et al. “Provably Secure Masking of AES.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>.","short":"J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.","bibtex":"@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably Secure Masking of AES}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30564-4_5\">10.1007/978-3-540-30564-4_5</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004}, pages={69–83} }"},"year":"2004","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"user_id":"25078","_id":"3011","publication":"Selected Areas in Cryptography","type":"book_chapter","status":"public"}]