TII-254 McEliece key recovery challenge solved with just 27.2 GPU-hours
jedisct1 · x · 2026-09-14
Markku-Juhani O. Saarinen (Tampere University) published IACR ePrint 2026/1986, reporting a solution to the TII-254 McEliece key recovery challenge — the hardest solved challenge under the original brute-force metric (2^254).
- TII-254 uses parameters (m,t,n)=(8,12,223), defining a binary [223,127] code
- The method is a thirteen-step process: two complete 121-dimensional relation kernels computed at distinct public coordinates are combined to isolate a certified 80-dimensional pair core; a 64-dimensional common nuisance space is removed; the remaining 16 dimensions are identified as an F2^8 projective-line geometry, yielding all 87 visible locators
- A deterministic completion search then recovers the full support and polynomial; the two Krylov sequences alone took 27.2 GPU-hours on NVIDIA GH200s
- The artifact includes compact recovery inputs, code, an independent key verifier, and Lean proofs of reusable linear-algebraic steps
More from Research
- Fudan NLP paper explains why max reasoning settings can backfire on SWE benchmarks — karminski3 · 2026-09-14
- OpenAI's 10,000-agent inference-scaling graph still shows logarithmic gains, says Toby Ord — tobyordoxford · 2026-09-14
- Deep learning + Sentinel-1 radar yields first high-res Antarctic map of nearly 40,000 grounded icebergs — anselm · 2026-09-14
- Tencent's retrieval models dominate Hugging Face trends with 4 entries — tomaarsen · 2026-09-14
- Diversity-Aware Skill Routing Uses DPP to Cut Redundant LLM Agent Skill Picks — Wang Wei · 2026-09-14
- Contextual Bandit Algorithms Route Prompts to LLM Experts with Sublinear Regret — Wang Wei · 2026-09-14