Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 1996 | 1000 | 1996 |

An XOR-based erasure-resilient coding scheme J Blomer Technical report at ICSI, 1995 | 566 | 1995 |

Fault based cryptanalysis of the advanced encryption standard (AES) J Blömer, JP Seifert Financial cryptography 2742, 162-181, 2003 | 507 | 2003 |

Provably Secure Masking of AES. J Blömer, J Guajardo, V Krummel Selected Areas in Cryptography 3357, 69-83, 2004 | 371 | 2004 |

Approximate matching of polygonal shapes H Alt, B Behrends, J Blömer Proceedings of the seventh annual symposium on Computational geometry, 186-193, 1991 | 326 | 1991 |

A new CRT-RSA algorithm secure against Bellcore attacks J Blömer, M Otto, JP Seifert Proceedings of the 10th ACM conference on Computer and communications …, 2003 | 201 | 2003 |

System for packetizing data encoded corresponding to priority levels where reconstructed data corresponds to fractionalized priority level and received fractionalized packets A Albanese, MG Luby, JF Bloemer, JA Edmonds US Patent 5,617,541, 1997 | 200 | 1997 |

Sign Change Fault Attacks on Elliptic Curve Cryptosystems. J Blömer, M Otto, JP Seifert FDTC 4236, 36-52, 2006 | 169 | 2006 |

New partial key exposure attacks on RSA J Blömer, A May Advances in Cryptology-CRYPTO 2003: 23rd Annual International Cryptology …, 2003 | 166 | 2003 |

Clustering for metric and nonmetric distance measures MR Ackermann, J Blömer, C Sohler ACM Transactions on Algorithms (TALG) 6 (4), 1-26, 2010 | 162 | 2010 |

The rank of sparse random matrices over finite fields J Blömer, R Karp, E Welzl Random Structures & Algorithms 10 (4), 407-419, 1997 | 117 | 1997 |

A generalized Wiener attack on RSA J Blömer, A May Public Key Cryptography–PKC 2004: 7th International Workshop on Theory and …, 2004 | 107 | 2004 |

Low secret exponent RSA revisited J Blömer, A May Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001 | 105 | 2001 |

Theoretical Analysis of the *k*-Means Algorithm – A SurveyJ Blömer, C Lammersen, M Schmidt, C Sohler Algorithm Engineering: Selected Results and Surveys, 81-116, 2016 | 95 | 2016 |

On the complexity of computing short linearly independent vectors and short bases in a lattice J Blömer, JP Seifert Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 93 | 1999 |

Fault Based Collision Attacks on AES. J Blömer, V Krummel FDTC 4236, 106-120, 2006 | 74 | 2006 |

Sampling methods for shortest vectors, closest vectors and successive minima J Blömer, S Naewe Theoretical Computer Science 410 (18), 1648-1665, 2009 | 73 | 2009 |

A tool kit for finding small roots of bivariate polynomials over the integers J Blömer, A May Advances in Cryptology–EUROCRYPT 2005: 24th Annual International Conference …, 2005 | 71 | 2005 |

Analysis of agglomerative clustering MR Ackermann, J Blömer, D Kuntze, C Sohler Algorithmica 69, 184-215, 2014 | 66 | 2014 |

Approximation of convex polygons H Alt, J Blömer, H Wagener Automata, Languages and Programming: 17th International Colloquium Warwick …, 1990 | 66 | 1990 |