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
Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13
LibreCat
| DOI
2006 | Journal Article | LibreCat-ID: 3003
Blömer J. Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (JUCS). 2006;(6):654--671. doi:10.3217/jucs-012-06-0654
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:10.1007/11889700_11
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:10.1007/11889700_2
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3006
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
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3011
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
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
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
LibreCat
| Files available
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
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
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
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
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
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
LibreCat
| DOI
2002 | Journal Article | LibreCat-ID: 3034
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
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
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
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
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
LibreCat
| Files available
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
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
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
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
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
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.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
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
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. Random Structures \& Algorithms. 1997;(4):407-419. doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat
| DOI
1995 | Journal Article | LibreCat-ID: 3037
Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence. 1995;13(3).
LibreCat
1995 | Report | LibreCat-ID: 3038
Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. An XOR-Based Erasure-Resilient Coding Scheme. Berkeley, USA; 1995.
LibreCat
| Files available
1992 | Dissertation | LibreCat-ID: 3043
Blömer J. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1992.
LibreCat
| Files available
1992 | Book Chapter | LibreCat-ID: 3046
Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:10.1007/3-540-55488-2_19
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 3047
Blömer J. How to denest Ramanujan’s nested radicals. In: Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE; 1992. doi:10.1109/sfcs.1992.267807
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3048
Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended abstract). In: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91. ACM Press; 1991. doi:10.1145/109648.109669
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat
| DOI