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