Todtenbier, Christian. Implementierung eines arithmetischen Kodierers in Java, 2003.
LibreCat: /record/47637

Ziegler, Max. Fehlerangriffe Auf Spezielle Implementierungen von RSA, 2003.
LibreCat: /record/47634

Lindner, Marvin. Verkürzte Huffman-Codierung zur Codekompression, 2003.
LibreCat: /record/47639

Ackermann, Marcel R. Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten, 2003.
LibreCat: /record/47695

Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/18.556670__IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44.https://doi.org/10.1109/18.556670 .
LibreCat: /record/3034
DOI: 10.1109/18.556670

Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/sfcs.1994.365731__In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1994.365731 .
LibreCat: /record/3040
DOI: 10.1109/sfcs.1994.365731

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1991.185434 .
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Blömer, J. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/s004530010028__Algorithmica 28, no. 1 (2002): 2–15.https://doi.org/10.1007/s004530010028 .
LibreCat: /record/35857
DOI: 10.1007/s004530010028

Fricke, Birgitta. Construction of Pseudorandom Functions, 2002.
LibreCat: /record/47698

Deveci, Deniz. Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems, 2002.
LibreCat: /record/47697

Helbich, Anke. The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.
LibreCat: /record/47699

Schepers, Daniel. Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.
LibreCat: /record/47700

Hoppe, Ulrich. Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002.
LibreCat: /record/47633

Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.
LibreCat: /record/47701

Otto, Martin. Brauer Addition-Subtraction Chains, 2001.
LibreCat: /record/47702

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.”https://doi.org/10.1145/301250.301441__In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. ACM Press, 1999.https://doi.org/10.1145/301250.301441 .
LibreCat: /record/3024
DOI: 10.1145/301250.301441

Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat: /record/3028

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.”https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y__Random Structures \'26; Algorithms, no. 4 (1997): 407–19.https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y .
LibreCat: /record/3033
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y