The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography
A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.

Timing Attacks for Cryptosystems based on Elliptic Curves
D. Schepers, Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.

Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen
U. Hoppe, Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002.

Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael
V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.

Brauer Addition-Subtraction Chains
M. Otto, Brauer Addition-Subtraction Chains, 2001.

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.

On the complexity of computing short linearly independent vectors and short bases in a lattice
J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999.

A lower bound for a class of graph based loss resilient codes
J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).

Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.

The rank of sparse random matrices over finite fields
J. Blömer, R. Karp, E. Welzl, Random Structures \'26; Algorithms (1997) 407–419.

Approximate matching of polygonal shapes
H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).

An XOR-based erasure-resilient coding scheme
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.

On Kummer theory and the number of roots of unity in radical extensions of Q
J. Blömer, On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q, Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.

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

Resemblance and symmetries of geometric patterns
H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.

How to denest Ramanujan's nested radicals
J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992.

Approximate matching of polygonal shapes (extended abstract)
H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 1991.

Computing sums of radicals in polynomial time
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.

Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.