Update README.md
Browse files
README.md
CHANGED
|
@@ -10,4 +10,46 @@ configs:
|
|
| 10 |
data_files:
|
| 11 |
- split: lower
|
| 12 |
path: liber_primus_undecoded_pseudolatin_lower.parquet
|
| 13 |
-
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 10 |
data_files:
|
| 11 |
- split: lower
|
| 12 |
path: liber_primus_undecoded_pseudolatin_lower.parquet
|
| 13 |
+
---
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
| Algorithm / cipher family tested | Result |
|
| 17 |
+
|---|---|
|
| 18 |
+
| Caesar cipher modulo 29 — all 29 shifts | ❌ |
|
| 19 |
+
| Atbash modulo 29 — `x → 28-x` | ❌ |
|
| 20 |
+
| Affine substitution modulo 29 — all invertible multipliers and offsets | ❌ |
|
| 21 |
+
| Vigenère-like periodicity analysis modulo 29 — periods up to 100 | ❌ |
|
| 22 |
+
| Vigenère modulo 29 — periods 1–16, coordinate-ascent search | ❌ |
|
| 23 |
+
| Beaufort modulo 29 — periods 1–16, coordinate-ascent search | ❌ |
|
| 24 |
+
| Variant Beaufort modulo 29 — periods 1–16, coordinate-ascent search | ❌ |
|
| 25 |
+
| Gronsfeld cipher — periods 1–16 | ❌ |
|
| 26 |
+
| First-order affine recurrence modulo 29 | ❌ |
|
| 27 |
+
| Second-order linear recurrence modulo 29 | ❌ |
|
| 28 |
+
| Arithmetic keystream — `K[i] = a·i + b mod 29` | ❌ |
|
| 29 |
+
| Quadratic keystream — `K[i] = a·i² + b·i + c mod 29`, 20,000 candidates | ❌ |
|
| 30 |
+
| Linear congruential generator keystream modulo 29 — 48,000+ candidates | ❌ |
|
| 31 |
+
| Fibonacci running key modulo 29 | ❌ |
|
| 32 |
+
| Prime-number running key modulo 29 | ❌ |
|
| 33 |
+
| Euler-totient running key modulo 29 | ❌ |
|
| 34 |
+
| Square-number running key modulo 29 | ❌ |
|
| 35 |
+
| Triangular-number running key modulo 29 | ❌ |
|
| 36 |
+
| Linear-position running key modulo 29 | ❌ |
|
| 37 |
+
| Quadratic-position running key modulo 29 | ❌ |
|
| 38 |
+
| Mathematical running keys reset at each word | ❌ |
|
| 39 |
+
| Running keys derived from already solved Liber Primus pages | ❌ |
|
| 40 |
+
| Ciphertext autokey modulo 29 — periods 1–16 | ❌ |
|
| 41 |
+
| Ciphertext autokey modulo 29 — seed lengths 1–6 | ❌ |
|
| 42 |
+
| Plaintext autokey modulo 29 — periods up to 16, beam size 500 | ❌ |
|
| 43 |
+
| Plaintext autokey modulo 29 — seed lengths 1–6, beam size 100 | ❌ |
|
| 44 |
+
| Recursive linear autokey modulo 29 — 1,000 completed candidates | ❌ |
|
| 45 |
+
| Full-text reversal | ❌ |
|
| 46 |
+
| Per-word reversal | ❌ |
|
| 47 |
+
| Word-order reversal | ❌ |
|
| 48 |
+
| Rail Fence transposition — tested rail counts | ❌ |
|
| 49 |
+
| Columnar transposition — widths up to 20, natural and reversed column order | ❌ |
|
| 50 |
+
| Fixed-size block reversal | ❌ |
|
| 51 |
+
| Canonical small-block permutations | ❌ |
|
| 52 |
+
| Constant XOR masks — masks 0–31 followed by modulo 29 | ❌ |
|
| 53 |
+
| Page-dependent modular shifts — `K = page·a + seed mod 29` | ❌ |
|
| 54 |
+
| Playfair-like fractionation on a shifted 6×5 grid | ❌ |
|
| 55 |
+
| Bifid-like fractionation on a shifted 6×5 grid — periods up to 20 | ❌ |
|