| 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 | 619 | 2012 |
| Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface PK Agarwal, T Akutsu, A Amihood, A Apostolico, C Benham, G Benson, ... Lecture notes in computer science (including subseries lecture notes in …, 2005 | 525* | 2005 |
| Decoding Random Linear Codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011 | 451 | 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 | 324 | 2015 |
| New RSA vulnerabilities using lattice reduction methods. A May University of Paderborn, 2003 | 258 | 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 | 237 | 2006 |
| Grover meets Simon–quantumly attacking the FX-construction G Leander, A May International conference on the theory and application of cryptology and …, 2017 | 232 | 2017 |
| New partial key exposure attacks on RSA J Blömer, A May Annual International Cryptology Conference, 27-43, 2003 | 196 | 2003 |
| Using LLL-reduction for solving RSA and factorization problems A May The LLL algorithm: survey and applications, 315-348, 2009 | 192 | 2009 |
| Partial key exposure attacks on RSA up to full size exponents M Ernst, E Jochemsz, A May, B De Weger Annual International Conference on the Theory and Applications of …, 2005 | 185 | 2005 |
| Decoding linear codes with high error rate and its impact for LPN security L Both, A May International Conference on Post-Quantum Cryptography, 25-46, 2018 | 143 | 2018 |
| A generalized Wiener attack on RSA J Blömer, A May International Workshop on Public Key Cryptography, 1-13, 2004 | 141 | 2004 |
| 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 | 135 | 2008 |
| Dimension reduction methods for convolution modular lattices A May, JH Silverman International Cryptography and Lattices Conference, 110-125, 2001 | 129 | 2001 |
| Deterministic polynomial-time equivalence of computing the rsa secret key and factoring JS Coron, A May Journal of Cryptology 20 (1), 39-50, 2007 | 125 | 2007 |
| On CCA-secure somewhat homomorphic encryption J Loftus, A May, NP Smart, F Vercauteren International Workshop on Selected Areas in Cryptography, 55-72, 2011 | 117 | 2011 |
| Low secret exponent RSA revisited J Blömer, A May International cryptography and lattices conference, 4-19, 2001 | 117 | 2001 |
| LPN decoded A Esser, R Kübler, A May Annual International Cryptology Conference, 486-514, 2017 | 112 | 2017 |
| New attacks on RSA with small secret CRT-exponents D Bleichenbacher, A May International Workshop on Public Key Cryptography, 1-13, 2006 | 111 | 2006 |
| 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 | 103 | 2010 |
Alexander MeurerCITS, Ruhr-Universität BochumVerified email at rub.de
