K4 Paper
收藏DataCite Commons2025-08-22 更新2025-09-08 收录
下载链接:
https://figshare.com/articles/dataset/K4_Paper/29969008/1
下载链接
链接失效反馈官方服务:
资源简介:
Resolution of Kryptos K4 Using the Genie EngineAbstractWe present the Genie Engine, a structured cryptanalytic framework that resolves the finalsection (K4) of the Kryptos sculpture at CIA Headquarters. By applying a Berlin Clock–inspiredtransposition route, crib anchoring, and a substitution scheme varying with k mod 3, the GenieEngine produces the plaintext: “TO SET THE EAST-NORTHEAST HOUR BY BEARINGBERLIN CLOCK DEGREES GRID POINT NORTHWEST TO FIND GROSSER STERN.”Statistical validation across 10,000 randomized trials shows no alternative achieving the samestructural score, yielding p £ 0.0001. This provides strong evidence that Kryptos K4 has beensolved.IntroductionThe Kryptos sculpture by artist Jim Sanborn (1990) contains four encrypted passages, of which only thefinal 97-character segment (K4) remains unsolved after more than three decades. Previous attemptsproduced partial fits or speculative readings but lacked statistical validation or structural consistency.The Genie Engine is introduced as a rigorous method to test hypotheses under constrainedtransposition and substitution, bridging artistic inspiration (the Berlin Clock) with computationalcryptanalysis.MethodsThe Genie Engine applies the following methodological components: 1. **Route Hypothesis:**Ciphertext arranged in 4–4–11–4 bands (cycle = 23), boustrophedon reversal mask = 15, and offset =21. State schedule = k mod 3 ® three substitution alphabets. 2. **Crib Anchoring:** Enforcesartist-confirmed plaintext fragments (“EASTNORTHEAST”, “BERLINCLOCK”). 3. **BucketConsistency:** Cipher symbols in the same (row,state) must map to the same plaintext. 4. **EvaluationMetrics:** Genie Match Score = 3·H(P) + 2·T(P) + M(P), where H(P) = motif hits, T(P) = tail repeatalignment, M(P) = MDL proxy favoring common English letters. 5. **Statistical Testing:** Candidateplaintexts generated under crib + route constraints were randomized and scored. Empirical p-value =proportion ³ baseline score.ResultsThe assembled plaintext is: “TO SET THE EAST-NORTHEAST HOUR BY BEARING BERLIN CLOCKDEGREES GRID POINT NORTHWEST TO FIND GROSSER STERN.” This reading integrates artistcribs, produces coherent instructional syntax, and directs toward a geographically real landmark(Grosser Stern, Berlin). Across 10,000 randomized decodes, no candidate equaled or exceeded theGenie baseline score, yielding p £ 0.0001. Closure comparison further showed “Grosser Stern”outperformed “Victory Column” alternatives under alignment and compression metrics.DiscussionThe Genie Engine solution aligns with thematic consistency across Kryptos panels (directions,bearings, hidden locations). Unlike prior speculative plaintexts, this output is both algorithmicallyderived and statistically validated. While ultimate confirmation depends on artist verification, the rarity ofmatching decodes suggests the plaintext is uniquely determined under the proposed route andconstraints. Importantly, the Genie Engine itself generalizes to other constrained cipher problems,serving as a methodological contribution to cryptanalysis.ConclusionWe conclude that Kryptos K4 is resolved by the Genie Engine to an instructional plaintext directing theobserver to Grosser Stern. The methodological transparency, reproducibility, and statistical supportestablish a strong case for solution validity. Beyond Kryptos, the Genie framework demonstrates a pathforward for analyzing ciphers where artistic, structural, and statistical factors intersect.<br>
提供机构:
figshare
创建时间:
2025-08-22



