Revisiting the May--Meurer--Thomae Algorithm --- Solving McEliece-1409 in One Day

ePrint Report: Revisiting the May--Meurer--Thomae Algorithm --- Solving McEliece-1409 in One Day

Shintaro Narisada, Shusaku Uemura, Hiroki Okada, Hiroki Furue, Yusuke Aikawa, Kazuhide Fukushima

As post-quantum cryptography transitions toward practical deployment, the significance of extensive cryptanalysis is on the rise. Three out of the four NIST-PQC round 4 candidates are forms of code-based cryptography. Analyses of asymptotic complexity in information set decoding (ISD) algorithms have been a central focus in the field of code-based cryptography. Recently, Esser, May and Zweydinger …

algorithm candidates cryptanalysis cryptography deployment eprint report may nist post-quantum post-quantum cryptography pqc quantum quantum cryptography report transitions