Monoalphabetic affine cipher exhaustive disproof

In plain English: Monoalphabetic affine cipher exhaustive disproof — using a simple letter-shifting method (Caesar/ROT cipher or affine substitution). This approach is ruled out within the tested scope.

ELIMINATED

How to read this record

Verdict – NOISE (no better than random guessing), INTERESTING (slightly above random, almost certainly coincidence), SIGNAL (statistically unusual, warrants investigation), or FULL MATCH (all 24 known letters correct).
Confidence Tier – Tier 1 = mathematical proof (permanent). Tier 2 = every possibility tested. Tier 3 = partially tested. Tier 4 = not yet tested.
Configs Tested – How many different key/parameter combinations were tried.
Best Score – How many of the 24 known plaintext letters the best attempt matched (out of 24).
Keystream Consistency (Bean) – Whether the key values at different positions are mathematically consistent with each other.
Scope Limitations – What this elimination does not rule out.

Configs Tested: N/A
Best Score: 0 / 24 known letters matched · no better than random guessing (random guess would score: 0.0)
Keystream Consistency (Bean): FAIL
Checks whether the key values at different positions are mathematically consistent with each other.
Confidence: Not classified.
Script: scripts/substitution/e_affine_mono_disproof.py

Reproduce

PYTHONPATH=src python3 -u scripts/substitution/e_affine_mono_disproof.py

Requires the kryptos repo, Python 3.11+, PYTHONPATH=src.

Found an error? Report on GitHub