@bookOtto_2005, title=Fault Attacks and Countermeasures, publisher=Universität Paderborn, author=Otto, Martin, year=2005 

@inbookBlömer_May_2005, place=Berlin, Heidelberg, series=Lecture Notes in Computer Science, title=A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, DOI=10.1007/11426639_15, booktitle=EUROCRYPT 2005, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes and May, Alexander, year=2005, pages=251–267, collection=Lecture Notes in Computer Science 

@inbookErnst_Jochemsz_May_de Weger_2005, place=Berlin, Heidelberg, series=LNCS, title=Partial Key Exposure Attacks on RSA up to Full Size Exponents, DOI=10.1007/11426639_22, booktitle=EUROCRYPT 2005, publisher=Springer Berlin Heidelberg, author=Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne, year=2005, pages=371–386, collection=LNCS 

@inbookBlömer_Guajardo_Krummel_2004, place=Berlin, Heidelberg, title=Provably Secure Masking of AES, DOI=10.1007/978-3-540-30564-4_5, booktitle=Selected Areas in Cryptography, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes and Guajardo, Jorge and Krummel, Volker, year=2004, pages=69–83 

@inbookBlömer_May_2004, place=Berlin, Heidelberg, title=A Generalized Wiener Attack on RSA, DOI=10.1007/978-3-540-24632-9_1, booktitle=Public Key Cryptography – PKC 2004, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes and May, Alexander, year=2004, pages=1–13 

@inbookMay_2004, place=Berlin, Heidelberg, title=Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq, DOI=10.1007/978-3-540-24632-9_16, booktitle=Public Key Cryptography – PKC 2004, publisher=Springer Berlin Heidelberg, author=May, Alexander, year=2004, pages=218–230 

@inbookMay_2004, place=Berlin, Heidelberg, title=Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring, DOI=10.1007/978-3-540-28628-8_13, booktitle=Advances in Cryptology – CRYPTO 2004, publisher=Springer Berlin Heidelberg, author=May, Alexander, year=2004, pages=213–219 

@inproceedingsBlömer_Otto_Seifert_2004, title=A new CRT-RSA algorithm secure against bellcore attacks, DOI=10.1145/948109.948151, booktitle=Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, publisher=ACM Press, author=Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre, year=2004 

@bookMay_2003, title=New RSA Vulnerabilities Using Lattice Reduction Methods, publisher=Universität Paderborn, author=May, Alexander, year=2003 

@inbookBlömer_May_2003, place=Berlin, Heidelberg, title=New Partial Key Exposure Attacks on RSA, DOI=10.1007/978-3-540-45146-4_2, booktitle=Advances in Cryptology - CRYPTO 2003, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes and May, Alexander, year=2003, pages=27–43 

@inbookBlömer_Seifert_2003, place=Berlin, Heidelberg, title=Fault Based Cryptanalysis of the Advanced Encryption Standard (AES), DOI=10.1007/978-3-540-45126-6_12, booktitle=Financial Cryptography, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes and Seifert, Jean-Pierre, year=2003, pages=162–181 

@articleAlbanese_Blömer_Edmonds_Luby_Sudan_2002, title=Priority encoding transmission, volume=42, DOI=10.1109/18.556670, number=6, journal=IEEE Transactions on Information Theory, publisher=Institute of Electrical and Electronics Engineers (IEEE), author=Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu, year=2002, pages=1737–1744 

@inproceedingsAlbanese_Blömer_Edmonds_Luby_Sudan_2002, title=Priority encoding transmission, DOI=10.1109/sfcs.1994.365731, booktitle=Proceedings 35th Annual Symposium on Foundations of Computer Science, publisher=IEEE Comput. Soc. Press, author=Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M., year=2002 

@inproceedingsBlömer_2002, title=Computing sums of radicals in polynomial time, DOI=10.1109/sfcs.1991.185434, booktitle=[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, publisher=IEEE Comput. Soc. Press, author=Blömer, Johannes, year=2002 

@articleBlömer_2002, title=Denesting by Bounded Degree Radicals, volume=28, DOI=10.1007/s004530010028, number=1, journal=Algorithmica, publisher=Springer Science and Business Media LLC, author=Blömer, J., year=2002, pages=2–15 

@inbookBlömer_2000, place=Berlin, Heidelberg, title=Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices, DOI=10.1007/3-540-45022-x_22, booktitle=Automata, Languages and Programming, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes, year=2000, pages=248–259 

@inproceedingsBlömer_Seifert_1999, title=On the complexity of computing short linearly independent vectors and short bases in a lattice, DOI=10.1145/301250.301441, booktitle=Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC ’99, publisher=ACM Press, author=Blömer, Johannes and Seifert, Jean-Pierre, year=1999 

@articleBlömer_Trachsler_1998, title=A lower bound for a class of graph based loss resilient codes, journal=Technical report/Departement of Computer Science, ETH Zürich, author=Blömer, Johannes and Trachsler, Beat, year=1998 

@inbookBlömer_1997, place=Berlin, Heidelberg, title=Denesting by bounded degree radicals, DOI=10.1007/3-540-63397-9_5, booktitle=Algorithms — ESA ’97, publisher=Springer Berlin Heidelberg, author=Blömer, Johannes, year=1997, pages=53–63 

@articleBlömer_Karp_Welzl_1997, title=The rank of sparse random matrices over finite fields, DOI=10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y, number=4, journal=Random Structures \'26; Algorithms, author=Blömer, Johannes and Karp, Richard and Welzl, Emo, year=1997, pages=407–419