Otto M. Fault Attacks and Countermeasures. Universität Paderborn; 2005.

Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15

Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: EUROCRYPT 2005. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:10.1007/11426639_22

Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5

Blömer J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1

May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:218-230. doi:10.1007/978-3-540-24632-9_16

May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13

Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press; 2004. doi:10.1145/948109.948151

May A. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn; 2003.

Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:10.1007/978-3-540-45146-4_2

Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:10.1007/978-3-540-45126-6_12

Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. IEEE Transactions on Information Theory. 2002;42(6):1737-1744. doi:10.1109/18.556670

Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1994.365731

Blömer J. Computing sums of radicals in polynomial time. In: [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. Algorithmica. 2002;28(1):2-15. doi:10.1007/s004530010028

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

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

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.

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

Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. Random Structures \'26; Algorithms. 1997;(4):407-419. doi:10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y