Carl Löndahl

According to our database, Carl Löndahl authored at least 9 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Solving LPN Using Covering Codes.

Qian Guo, Thomas Johansson, Carl Löndahl

J. Cryptol., 2020

2016

Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension.

Carl Löndahl, Thomas Johansson, Masoumeh Koochak Shooshtari, Mahmoud Ahmadian-Attari, Mohammad Reza Aref

Des. Codes Cryptogr., 2016

2015

Some Notes on Code-Based Cryptography.

Carl Löndahl

PhD thesis, 2015

A New Algorithm for Solving Ring-LPN With a Reducible Polynomial.

Qian Guo, Thomas Johansson, Carl Löndahl

IEEE Trans. Inf. Theory, 2015

A note on the security of the hHB protocol.

Carl Löndahl

CoRR, 2015

2014

Improved algorithms for finding low-weight polynomial multiples in F₂[x] and some cryptographic applications.

Carl Löndahl, Thomas Johansson

Des. Codes Cryptogr., 2014

2012

A survey on fast correlation attacks.

Martin Ågren, Carl Löndahl, Martin Hell, Thomas Johansson

Cryptogr. Commun., 2012

Improved message passing techniques in fast correlation attacks on stream ciphers.

Martin Ågren, Martin Hell, Thomas Johansson, Carl Löndahl

Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

A New Version of McEliece PKC Based on Convolutional Codes.

Carl Löndahl, Thomas Johansson

Proceedings of the Information and Communications Security - 14th International Conference, 2012