Preprint
Sep 2026
A Polynomial-Time Attack on the McEliece Cryptosystem on Elliptic Codes with Arbitrary Divisors
It is proved that, given the elliptic curve, the public generator matrix, and three points from the evaluation divisor, the entire divisor can be recovered in polynomial time, independently of the number of errors used in the cryptosystem.
Artyom Kuninets, Ekaterina Malygina, E. Melnichuk
· 0 citations