Todtenbier, Christian. Implementierung eines arithmetischen Kodierers in Java. 2003.

Ziegler, Max. Fehlerangriffe Auf Spezielle Implementierungen von RSA. 2003.

Lindner, Marvin. Verkürzte Huffman-Codierung zur Codekompression. 2003.

Ackermann, Marcel R. Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten. 2003.

Albanese, Andres, et al. “Priority Encoding Transmission.”10.1109/18.556670__IEEE Transactions on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.

Albanese, A., et al. “Priority Encoding Transmission.”10.1109/sfcs.1994.365731__Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1994.365731.

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

Blömer, J. “Denesting by Bounded Degree Radicals.”10.1007/s004530010028__Algorithmica, vol. 28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:10.1007/s004530010028.

Fricke, Birgitta. Construction of Pseudorandom Functions. 2002.

Deveci, Deniz. Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems. 2002.

Helbich, Anke. The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography. 2002.

Schepers, Daniel. Timing Attacks for Cryptosystems Based on Elliptic Curves. 2002.

Hoppe, Ulrich. Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen. 2002.

Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael. 2001.

Otto, Martin. Brauer Addition-Subtraction Chains. 2001.

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”10.1007/3-540-45022-x_22__Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, 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.”10.1145/301250.301441__Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999, 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.

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”10.1007/3-540-63397-9_5__Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.

Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.”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, pp. 407–19, doi:10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y.