OrbitalProof · Wi-Fi security · for a technical reader
An automated attack search against quantum-safe Wi-Fi sign-in: the lab’s exact wording
The lab’s own sentences and figures for this result, word for word, in its working terms, with its limits in plain words where the lab’s text cannot be reprinted. The plain account is on the result’s page; it says the same things in plain words.
The lab’s plain-English sentence
An automated attacker, given no hints, tried 11,200 combinations of known Wi-Fi sign-in attacks … against the lab's own software models of its hardened versions of ten quantum-resistant Wi-Fi sign-in designs (not real Wi-Fi software), and found no attack that got through
- about 1,120 per design, roughly 1% of just the two-step combinations, while combinations of up to ten steps were allowed
- a search within a small fixed budget, not a proof that none exists
[Plain gloss of the sentence above: “given no hints” means given no starting attack sequence; the search builds every attempt only from moves on the lab’s own list of known attacks.]
Within the search budget
searched 11,200 compound attacks over the whole design axis and found zero escapes
The limit to read first, in the lab’s words
Exhaustive only up to three families per compound; budgeted above that.
Claim
An unseeded adversary searched 11,200 compound attacks over the whole design axis and found zero escapes, with every elite non-vacuous; an exhaustive enumeration of the same grammar, every compound of up to three attack families on all ten designs, 53,485 in all, also found zero escapes.
Limits
[The lab’s limits name program files this site does not serve, so they are not reprinted word for word. In plain words: the run is exhaustive only for combinations of up to three attack families from each design’s own list of moves; four to ten families were covered only by the budgeted search, a null result, not a proof. The designs, attacks and verifier are the lab’s own Python models, not real Wi-Fi software; with one known attack re-opened, the same enumeration found escapes.]
More
- The plain account of this result: the problem, what was shown, what it means for a buyer, who we expect would buy, why now, why you can trust the check, and what it does not show yet.
- This result’s file, the source of every sentence above.
- The formal statement of this result, set as a formula, with the other formal statements.