Fault Attacks and Countermeasures
M. Otto, Fault Attacks and Countermeasures, Universität Paderborn, 2005.
LibreCat: /record/2913

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Partial Key Exposure Attacks on RSA up to Full Size Exponents
M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.
LibreCat: /record/3010
DOI: 10.1007/11426639_22

Provably Secure Masking of AES
J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

A Generalized Wiener Attack on RSA
J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

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

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

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

New RSA Vulnerabilities Using Lattice Reduction Methods
A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, Universität Paderborn, 2003.
LibreCat: /record/2914

New Partial Key Exposure Attacks on RSA
J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Priority encoding transmission
A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.
LibreCat: /record/3034
DOI: 10.1109/18.556670

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

Computing sums of radicals in polynomial time
J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Denesting by Bounded Degree Radicals
J. Blömer, Algorithmica 28 (2002) 2–15.
LibreCat: /record/35857
DOI: 10.1007/s004530010028

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

On the complexity of computing short linearly independent vectors and short bases in a lattice
J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999.
LibreCat: /record/3024
DOI: 10.1145/301250.301441

A lower bound for a class of graph based loss resilient codes
J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).
LibreCat: /record/3028

Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

The rank of sparse random matrices over finite fields
J. Blömer, R. Karp, E. Welzl, Random Structures \'26; Algorithms (1997) 407–419.
LibreCat: /record/3033
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y