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
- 1
- 2
- 3
- 4
- 5 (current)
2003 | Bachelorsthesis | LibreCat-ID: 47637
C. Todtenbier, Implementierung eines arithmetischen Kodierers in Java. 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
M. Ziegler, Fehlerangriffe auf spezielle Implementierungen von RSA. 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
M. Lindner, Verkürzte Huffman-Codierung zur Codekompression. 2003.
LibreCat
2003 | Misc | LibreCat-ID: 47695 |
M. R. Ackermann, Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten. 2003.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
J. Blömer, “Denesting by Bounded Degree Radicals,” Algorithmica, vol. 28, no. 1, pp. 2–15, 2002, doi: 10.1007/s004530010028.
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
B. Fricke, Construction of Pseudorandom Functions. 2002.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
D. Deveci, Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems. 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47699
A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography. 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47700
D. Schepers, Timing Attacks for Cryptosystems based on Elliptic Curves. 2002.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
U. Hoppe, Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen. 2002.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
V. Krummel, Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael. 2001.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
M. Otto, Brauer Addition-Subtraction Chains. 2001.
LibreCat
| Files available
1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. Trachsler, “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
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat
| Files available
| DOI
1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat
| Files available
1993 | Report | LibreCat-ID: 3045
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.
LibreCat
1992 | Dissertation | LibreCat-ID: 3043
J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat
| Files available
- 1
- 2
- 3
- 4
- 5 (current)