| 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 |
| Decoding random linear codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011 | 451 | 2011 |
| Quantum algorithms for the subset-sum problem DJ Bernstein, S Jeffery, T Lange, A Meurer International Workshop on Post-Quantum Cryptography, 16-33, 2013 | 123 | 2013 |
| Correcting errors in RSA private keys W Henecka, A May, A Meurer Annual Cryptology Conference, 351-369, 2010 | 76 | 2010 |
| A coding-theoretic approach to cryptanalysis A Meurer Verlag nicht ermittelbar, 2013 | 46 | 2013 |
| Decoding random linear codes inO (20. 054𝑛) A May, A Meurer, E Thomae Advances in Cryptology–ASIACRYPT, 107-124, 2011 | 9 | 2011 |
| New attacks for knapsack based cryptosystems G Herold, A Meurer International Conference on Security and Cryptography for Networks, 326-342, 2012 | 8 | 2012 |
| Decoding Random Linear Codes in O (20. 054n) In Asiacrypt 2011 A May, A Meurer, E Thomae Springer, 2011 | 7 | 2011 |
| Quantum algorithms for the subset-sum problem DJ Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven S Jeffery, T Lange, A Meurer | | |
Alexander MayRuhr-Universität BochumVerified email at rub.de
