| Decoding Random Binary Linear Codes in 2n/20: How 1 + 1 = 0 Improves Information Set Decoding A Becker, A Joux, A May, A Meurer Annual international conference on the theory and applications of …, 2012 | 382 | 2012 |
| Decoding Random Linear Codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011 | 285 | 2011 |
| On computing nearest neighbors with applications to decoding of binary linear codes A May, I Ozerov Annual International Conference on the Theory and Applications of …, 2015 | 190 | 2015 |
| New RSA vulnerabilities using lattice reduction methods. A May University of Paderborn, 2003 | 177 | 2003 |
| A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants E Jochemsz, A May International Conference on the Theory and Application of Cryptology and …, 2006 | 169 | 2006 |
| New partial key exposure attacks on RSA J Blömer, A May Annual International Cryptology Conference, 27-43, 2003 | 158 | 2003 |
| Partial key exposure attacks on RSA up to full size exponents M Ernst, E Jochemsz, A May, B Weger Annual International Conference on the Theory and Applications of …, 2005 | 140 | 2005 |
| Using LLL-reduction for solving RSA and factorization problems A May The LLL algorithm, 315-348, 2009 | 137 | 2009 |
| Deterministic polynomial-time equivalence of computing the RSA secret key and factoring JS Coron, A May Journal of Cryptology 20 (1), 39-50, 2007 | 108 | 2007 |
| Dimension reduction methods for convolution modular lattices A May, JH Silverman International Cryptography and Lattices Conference, 110-125, 2001 | 101 | 2001 |
| Grover meets Simon–quantumly attacking the FX-construction G Leander, A May International Conference on the Theory and Application of Cryptology and …, 2017 | 100 | 2017 |
| A generalized Wiener attack on RSA J Blömer, A May International Workshop on Public Key Cryptography, 1-13, 2004 | 100 | 2004 |
| New attacks on RSA with small secret CRT-exponents D Bleichenbacher, A May International Workshop on Public Key Cryptography, 1-13, 2006 | 99 | 2006 |
| Low secret exponent RSA revisited J Blömer, A May International Cryptography and Lattices Conference, 4-19, 2001 | 99 | 2001 |
| Solving linear equations modulo divisors: On factoring given any bits M Herrmann, A May International Conference on the Theory and Application of Cryptology and …, 2008 | 98 | 2008 |
| A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 E Jochemsz, A May Annual International Cryptology Conference, 395-411, 2007 | 89 | 2007 |
| Computing the RSA secret key is deterministic polynomial time equivalent to factoring A May Annual International Cryptology Conference, 213-219, 2004 | 87 | 2004 |
| Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006 | 84 | 2006 |
| On CCA-secure somewhat homomorphic encryption J Loftus, A May, NP Smart, F Vercauteren International Workshop on Selected Areas in Cryptography, 55-72, 2011 | 79 | 2011 |
| Maximizing small root bounds by linearization and applications to small secret exponent RSA M Herrmann, A May International Workshop on Public Key Cryptography, 53-69, 2010 | 75 | 2010 |
Johannes BloemerProfessor for Computer Science, Paderborn UniversityVerified email at mail.upb.de
