J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
LibreCat: /record/3003
DOI: 10.3217/jucs-012-06-0654

H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629

J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat: /record/488

J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
LibreCat: /record/253
DOI: 10.1007/978-3-319-32859-1_14

J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat: /record/3007
DOI: 10.1007/11889700_4

J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat: /record/3043

J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), 2016.
LibreCat: /record/2947
DOI: 10.1109/fdtc.2015.17

J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat: /record/2987

J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017, vol. 10693, pp. 438–453.
LibreCat: /record/2967
DOI: 10.1007/978-3-319-72453-9_35

J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \'26; Algorithms, no. 4, pp. 407–419, 1997.
LibreCat: /record/3033
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y

J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer International Publishing, 2016, pp. 81–116.
LibreCat: /record/2968
DOI: 10.1007/978-3-319-49487-6_3

J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,”10.1145/3319535.3354223__presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi:10.1145/3319535.3354223 .
LibreCat: /record/13904
DOI: 10.1145/3319535.3354223

J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.
LibreCat: /record/2685
DOI: 10.1137/17M1132045

J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/233

J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat: /record/3005
DOI: 10.1007/11889700_2