Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
229 Publications
2002 | Misc | LibreCat-ID: 47699
Helbich, A. (2002). The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, D. (2002). Timing Attacks for Cryptosystems based on Elliptic Curves.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 | 
Hoppe, U. (2002). Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, V. (2001). Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, M. (2001). Brauer Addition-Subtraction Chains.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat
| DOI