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
The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography
A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.
LibreCat
A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.
2002 | Misc | LibreCat-ID: 47700
Timing Attacks for Cryptosystems based on Elliptic Curves
D. Schepers, Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.
LibreCat
D. Schepers, Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.
2002 | Bachelorsthesis | LibreCat-ID: 47633 | 
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.
LibreCat
| Files available
U. Hoppe, Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002.
2001 | Misc | LibreCat-ID: 47701 |
Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael
V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.
LibreCat
| Files available
V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.
2001 | Misc | LibreCat-ID: 47702 |
Brauer Addition-Subtraction Chains
M. Otto, Brauer Addition-Subtraction Chains, 2001.
LibreCat
| Files available
M. Otto, Brauer Addition-Subtraction Chains, 2001.
2000 | Book Chapter | LibreCat-ID: 3023
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.
LibreCat
| DOI
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
1999 | Conference Paper | LibreCat-ID: 3024
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.
LibreCat
| Files available
| DOI
J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99, ACM Press, 1999.
1998 | Journal Article | LibreCat-ID: 3028
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).
LibreCat
| Files available
J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).
1997 | Book Chapter | LibreCat-ID: 3029
Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat
| Files available
| DOI
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
1997 | Journal Article | LibreCat-ID: 3033
The rank of sparse random matrices over finite fields
J. Blömer, R. Karp, E. Welzl, Random Structures \& Algorithms (1997) 407–419.
LibreCat
| DOI
J. Blömer, R. Karp, E. Welzl, Random Structures \& Algorithms (1997) 407–419.