| Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding A Becker, A Joux, A May, A Meurer Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012 | 559 | 2012 |
| Decoding random linear codes in A May, A Meurer, E Thomae International Conference on the Theory and Application of Cryptology and …, 2011 | 408 | 2011 |
| Quantum algorithms for the subset-sum problem DJ Bernstein, S Jeffery, T Lange, A Meurer Post-Quantum Cryptography: 5th International Workshop, PQCrypto 2013 …, 2013 | 113 | 2013 |
| Correcting errors in RSA private keys W Henecka, A May, A Meurer Annual Cryptology Conference, 351-369, 2010 | 73 | 2010 |
| A coding-theoretic approach to cryptanalysis A Meurer Verlag nicht ermittelbar, 2013 | 41 | 2013 |
| Decoding random linear codes inO (20. 054𝑛) A May, A Meurer, E Thomae Advances in Cryptology–ASIACRYPT, 107-124, 2011 | 8 | 2011 |
| New attacks for knapsack based cryptosystems G Herold, A Meurer International Conference on Security and Cryptography for Networks, 326-342, 2012 | 7 | 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 BochumBestätigte E-Mail-Adresse bei rub.de
