An Eleven-Year Question Answered in the Negative
![black and white manga panel, dramatic speed lines, Akira aesthetic, bold ink work, Colossal bronze bell suspended in an infinite dark void, its surface weathered with eleven concentric rings of patina, a single jagged crack splitting from crown to lip, emitting a burst of fine dust particles radiating outward like speed lines, harsh overhead spotlight creating stark contrast, the bell's interior pitch black, atmosphere of absolute finality and abandoned hope. [Z-Image Turbo] black and white manga panel, dramatic speed lines, Akira aesthetic, bold ink work, Colossal bronze bell suspended in an infinite dark void, its surface weathered with eleven concentric rings of patina, a single jagged crack splitting from crown to lip, emitting a burst of fine dust particles radiating outward like speed lines, harsh overhead spotlight creating stark contrast, the bell's interior pitch black, atmosphere of absolute finality and abandoned hope. [Z-Image Turbo]](https://cdn.digitalrain.dev/theqi/viral-images/0321ce33-3727-4b4e-b061-c334b7ba3d21_viral_2_square.jpg)
For eleven years a family of mathematical locks, meant to survive an age of sharper machines, carried an unanswered question. That question has now been answered — not with alarm, but with the quiet finality of a ledger closing.
Five cryptographers, from two Chinese universities and the Chinese Academy of Sciences, have settled an open question that has hung over lattice-based key exchange since 2015: a landmark family of post-quantum authenticated key exchange designs cannot be made secure against active adversaries, however they are hardened. Their geometric attack, published at the IACR Cryptology ePrint Archive on 14 September and accepted for ASIACRYPT 2026 in Hong Kong, breaks ZZDSD-AKE in about 1,700 queries and the hardened variant GDLL-KE in about 180. The protocols descend from MQV, the Diffie-Hellman family proposed in 1995, brought into the noisy world of lattice assumptions. The eCK model, the strictest formal framework for key exchange, allows an adversary to learn ephemeral key material from any completed session; the attack uses that very licence, together with leakage from the reconciliation signal, to recover the static secret. Against GDLL-KE, which added per-session randomization as a defence, the break proceeds in fewer queries and requires no such revealed ephemeral key at all. Deployed systems are untouched: neither protocol is a NIST standard, and the standardized path, ML-KEM composed with further components, is not of this design. The larger conclusion is architectural: the authors judge simple randomization insufficient and point future designers toward formally proven KEM-then-compose constructions, leaving the direct approach under a new minimum bar.
—Dr. Octavia Blythe
Dispatch from The Prepared E0
This piece was written by AI.
Published September 16, 2026
ai@theqi.news