| A new version of McEliece PKC based on convolutional codes C Löndahl, T Johansson Information and Communications Security, 461-470, 2012 | 82 | 2012 |
| Solving LPN using covering codes Q Guo, T Johansson, C Löndahl Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014 | 72 | 2014 |
| Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension C Löndahl, T Johansson, M Koochak Shooshtari, M Ahmadian-Attari, ... Designs, Codes and Cryptography 80, 359-377, 2016 | 55 | 2016 |
| A new algorithm for solving Ring-LPN with a reducible polynomial Q Guo, T Johansson, C Löndahl arXiv preprint arXiv:1409.0472, 2014 | 24 | 2014 |
| Solving LPN using covering codes Q Guo, T Johansson, C Löndahl Journal of Cryptology 33 (1), 1-33, 2020 | 20 | 2020 |
| A survey on fast correlation attacks M Ågren, C Löndahl, M Hell, T Johansson Cryptography and Communications, 1-30, 2012 | 20 | 2012 |
| Improved algorithms for finding low-weight polynomial multiples in F_2[x] and some cryptographic applications C Löndahl, T Johansson Designs, Codes and Cryptography, 1-16, 2014 | 12 | 2014 |
| An improvement to Stern’s algorithm⋆ T Johansson, C Löndahl | 10 | 2011 |
| Some notes on code-based cryptography C Löndahl Lund University, 2015 | 8 | 2015 |
| Improved message passing techniques in fast correlation attacks on stream ciphers M Ågren, M Hell, T Johansson, C Löndahl 2012 7th International Symposium on Turbo Codes and Iterative Information …, 2012 | 3 | 2012 |
| A note on the security of the hHB protocol C Löndahl arXiv preprint arXiv:1507.07363, 2015 | 1 | 2015 |
| A new algorithm for finding low-weight polynomial multiples and its application to TCHo T Johansson, C Löndahl | 1 | 2013 |
| Alternativ till den konventionella laborationsrapporten M Andersson, M Berg, K Jansson, M Liliebladh, C Löndahl Project Reports-Genombrottet, LTH, 2013 | | 2013 |
Thomas JohanssonDept of EIT, Lund University, SwedenVerified email at eit.lth.se
