The following pages link to Carl Löndahl (Q310241):
Displaying 6 items.
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- Solving LPN Using Covering Codes (Q2938835) (← links)
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial (Q2977130) (← links)
