Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

79 Publications


2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 

2006 | Journal Article | LibreCat-ID: 3003
J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3004
J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3005
J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 

2004 | Conference Paper | LibreCat-ID: 3017
J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, 2004.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 

2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat | Files available | DOI
 

2002 | Conference Paper | LibreCat-ID: 3040
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat | Files available | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat | Files available | DOI
 

1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” Technical report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat | Files available
 

1997 | Book Chapter | LibreCat-ID: 3029
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 

1997 | Journal Article | LibreCat-ID: 3033
J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \& Algorithms, no. 4, pp. 407–419, 1997.
LibreCat | DOI
 

1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
 

1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat | Files available
 

1992 | Dissertation | LibreCat-ID: 3043
J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat | Files available
 

1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 3047
J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3048
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91, 1991.
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3049
J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 

Filters and Search Terms

(person=23)

status=public

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed