22,430 followers
Similarly, the Crypto 2011 paper https://t.co/pfbv3txw8E, unaware of Sendrier's support-splitting algorithm S, proved that the problem solved by S is hard in a model of quantum computation, and claimed this was evidence of McEliece hardness. The same model