@inbook{3012, author = {{Blömer, Johannes and May, Alexander}}, booktitle = {{Public Key Cryptography – PKC 2004}}, isbn = {{9783540210184}}, issn = {{0302-9743}}, pages = {{1--13}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Generalized Wiener Attack on RSA}}}, doi = {{10.1007/978-3-540-24632-9_1}}, year = {{2004}}, } @inproceedings{3017, author = {{Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}}, booktitle = {{Proceedings of the 10th ACM conference on Computer and communication security - CCS '03}}, isbn = {{1581137389}}, publisher = {{ACM Press}}, title = {{{A new CRT-RSA algorithm secure against bellcore attacks}}}, doi = {{10.1145/948109.948151}}, year = {{2004}}, } @inbook{3016, author = {{Blömer, Johannes and May, Alexander}}, booktitle = {{Advances in Cryptology - CRYPTO 2003}}, isbn = {{9783540406747}}, issn = {{0302-9743}}, pages = {{27--43}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{New Partial Key Exposure Attacks on RSA}}}, doi = {{10.1007/978-3-540-45146-4_2}}, year = {{2003}}, } @inbook{3018, author = {{Blömer, Johannes and Seifert, Jean-Pierre}}, booktitle = {{Financial Cryptography}}, isbn = {{9783540406631}}, issn = {{0302-9743}}, pages = {{162--181}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}}}, doi = {{10.1007/978-3-540-45126-6_12}}, year = {{2003}}, } @article{3034, author = {{Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}}, issn = {{0018-9448}}, journal = {{IEEE Transactions on Information Theory}}, number = {{6}}, pages = {{1737--1744}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Priority encoding transmission}}}, doi = {{10.1109/18.556670}}, volume = {{42}}, year = {{2002}}, } @inproceedings{3040, author = {{Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}}, booktitle = {{Proceedings 35th Annual Symposium on Foundations of Computer Science}}, isbn = {{0818665807}}, publisher = {{IEEE Comput. Soc. Press}}, title = {{{Priority encoding transmission}}}, doi = {{10.1109/sfcs.1994.365731}}, year = {{2002}}, } @inproceedings{3041, author = {{Blömer, Johannes}}, booktitle = {{[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science}}, isbn = {{0818624450}}, publisher = {{IEEE Comput. Soc. Press}}, title = {{{Computing sums of radicals in polynomial time}}}, doi = {{10.1109/sfcs.1991.185434}}, year = {{2002}}, } @inbook{3023, author = {{Blömer, Johannes}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783540677154}}, issn = {{0302-9743}}, pages = {{248--259}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}}}, doi = {{10.1007/3-540-45022-x_22}}, year = {{2000}}, } @inproceedings{3024, author = {{Blömer, Johannes and Seifert, Jean-Pierre}}, booktitle = {{Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99}}, isbn = {{1581130678}}, publisher = {{ACM Press}}, title = {{{On the complexity of computing short linearly independent vectors and short bases in a lattice}}}, doi = {{10.1145/301250.301441}}, year = {{1999}}, } @article{3028, author = {{Blömer, Johannes and Trachsler, Beat}}, journal = {{Technical report/Departement of Computer Science, ETH Zürich}}, title = {{{A lower bound for a class of graph based loss resilient codes}}}, year = {{1998}}, } @inbook{3029, author = {{Blömer, Johannes}}, booktitle = {{Algorithms — ESA '97}}, isbn = {{9783540633976}}, issn = {{0302-9743}}, pages = {{53--63}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Denesting by bounded degree radicals}}}, doi = {{10.1007/3-540-63397-9_5}}, year = {{1997}}, } @article{3033, author = {{Blömer, Johannes and Karp, Richard and Welzl, Emo}}, journal = {{Random Structures \& Algorithms}}, keywords = {{random matrices, rank, finite fields}}, number = {{4}}, pages = {{407--419}}, title = {{{The rank of sparse random matrices over finite fields}}}, doi = {{10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y}}, year = {{1997}}, } @article{3037, abstract = {{For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster algorithms as the one for the general problem are obtained for special cases, namely thatI is restricted to translations or even to translations only in one specified direction. It turns out that determining pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant factor, can be done much more efficiently than determining optimal solutions. In the most general case, the algorithm for the pseudo-optimal solution is based on the surprising fact that for the optimal possible match betweenP and an imageI(Q) ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q) is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also shown that the Hausdorff distance between two polygons can be determined in timeO(n logn), wheren is the total number of vertices.}}, author = {{Alt, Helmut and Behrends, Bernd and Blömer, Johannes}}, issn = {{1573-7470}}, journal = {{Annals of Mathematics and Artificial Intelligence}}, number = {{3}}, title = {{{Approximate matching of polygonal shapes}}}, volume = {{13}}, year = {{1995}}, } @techreport{3038, author = {{Blömer, Johannes and Kalfane, Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman, David}}, title = {{{An XOR-based erasure-resilient coding scheme}}}, year = {{1995}}, } @phdthesis{3043, author = {{Blömer, Johannes}}, publisher = {{PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik}}, title = {{{Simplifying Expressions Involving Radicals}}}, year = {{1992}}, } @inbook{3046, author = {{Alt, Helmut and Blömer, Johannes}}, booktitle = {{Data structures and efficient algorithms}}, isbn = {{9783540554882}}, issn = {{0302-9743}}, pages = {{1--24}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Resemblance and symmetries of geometric patterns}}}, doi = {{10.1007/3-540-55488-2_19}}, year = {{1992}}, } @inproceedings{3047, author = {{Blömer, Johannes}}, booktitle = {{Proceedings., 33rd Annual Symposium on Foundations of Computer Science}}, isbn = {{0818629002}}, publisher = {{IEEE}}, title = {{{How to denest Ramanujan's nested radicals}}}, doi = {{10.1109/sfcs.1992.267807}}, year = {{1992}}, } @inproceedings{3048, author = {{Alt, Helmut and Behrends, Bernd and Blömer, Johannes}}, booktitle = {{Proceedings of the seventh annual symposium on Computational geometry - SCG '91}}, isbn = {{0897914260}}, publisher = {{ACM Press}}, title = {{{Approximate matching of polygonal shapes (extended abstract)}}}, doi = {{10.1145/109648.109669}}, year = {{1991}}, } @inproceedings{3049, author = {{Blömer, Johannes}}, booktitle = {{Proceedings 32nd Annual Symposium of Foundations of Computer Science}}, isbn = {{0818624450}}, publisher = {{IEEE Comput. Soc. Press}}, title = {{{Computing sums of radicals in polynomial time}}}, doi = {{10.1109/sfcs.1991.185434}}, year = {{1991}}, } @inbook{3050, author = {{Alt, Helmut and Blömer, Johannes and Wagener, Hubert}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{3540528261}}, pages = {{703--716}}, publisher = {{Springer-Verlag}}, title = {{{Approximation of convex polygons}}}, doi = {{10.1007/bfb0032068}}, year = {{1990}}, }