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, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.
LibreCat
| DOI
2006 | Journal Article | LibreCat-ID: 3003
Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6 (2006): 654--671. https://doi.org/10.3217/jucs-012-06-0654.
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_4.
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30564-4_5.
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_1.
LibreCat
| Files available
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “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. https://doi.org/10.1145/948109.948151.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2002 | Journal Article | LibreCat-ID: 3034
Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44. https://doi.org/10.1109/18.556670.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1994.365731.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/10.1007/3-540-45022-x_22.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, Johannes, and Jean-Pierre Seifert. “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. https://doi.org/10.1145/301250.301441.
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
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
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \& Algorithms, no. 4 (1997): 407–19. https://doi.org/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, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).
LibreCat
1995 | Report | LibreCat-ID: 3038
Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.
LibreCat
| Files available
1992 | Dissertation | LibreCat-ID: 3043
Blömer, Johannes. 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, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_19.
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. https://doi.org/10.1109/sfcs.1992.267807.
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3048
Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).” In Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91. ACM Press, 1991. https://doi.org/10.1145/109648.109669.
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.
LibreCat
| DOI