Extending Distinguishing to Key Recovery for Subfield Subcodes of GRS codes

Kirill Vedenev

ePrint 2026/1747

Time bound

2^89.9–2^98.6 conditional bit operations across Classic McEliece sets

Space bound

—

Source / version date

7 Oct 2026

Comparison variant

Classical · conditional concrete estimates

Cost scale

Concrete bit-operation estimates

assumptions

Source rank and solver assumptions

version_context

Apon2026/1810 addresses an earlier revision; Wang2026/2769 gives further rank-geometry analysis

Assumptions and source notes

Conditional rank/solver estimate; latest revision disputes applicability of the earlier Apon critique.

Source location

Abstract; revision note
Version: 2026-10-07

Primary source ↗

@misc{vedenev2026,
  author = {Kirill Vedenev},
  title = {{Extending Distinguishing to Key Recovery for Subfield Subcodes of GRS codes}},
  year = {2026},
  url = {https://eprint.iacr.org/2026/1747},
  cr_date = {2026-08-20},
  cr_status = {preprint},
  cr_author_ids = {kirill-vedenev}
}