Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”10.1007/3-540-44670-2_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”10.1007/3-540-45537-x_26__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”10.1007/3-540-68530-8_13__Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.”10.3217/jucs-012-06-0654__Journal of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.
LibreCat: /record/3003
DOI: 10.3217/jucs-012-06-0654

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”10.1007/11889700_11__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”10.1007/11889700_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”10.1007/11889700_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”10.1007/11426639_15__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Blömer, Johannes, et al. “Provably Secure Masking of AES.”10.1007/978-3-540-30564-4_5__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”10.1007/978-3-540-24632-9_1__Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.”10.1145/948109.948151__Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151.
LibreCat: /record/3017
DOI: 10.1145/948109.948151

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”10.1007/978-3-540-45146-4_2__Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”10.1007/978-3-540-45126-6_12__Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

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.
LibreCat: /record/3034
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.
LibreCat: /record/3040
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.
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

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.
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.”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.
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.”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.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5