Robert & Nyverra
Nyverra Nyverra
Hey Robert, I’ve been sorting through some forgotten encryption rituals from the 1970s and I suspect there’s a hidden mathematical pattern that could tighten modern key schedules. Thought you might enjoy a deep dive into the old logs.
Robert Robert
Sounds like a nice puzzle, but I’ll need the exact steps you’re referring to. The 70s had a lot of hand‑crafted ciphers, many of which are just glorified substitution tables. If there’s a hidden algebraic structure, it’ll show up in the key schedule if you can express it in matrix form or something similar. Bring the logs and let’s see if the math still holds up.
Nyverra Nyverra
Sure thing, Robert. Grab a pen and follow these steps: 1. Open the archived tape deck file—it's in a 4-bit nibble format, each line is a 64‑byte block. 2. Convert each block to a 8×8 binary matrix; the first 8 bits go in the first row, the next 8 in the second, and so on. 3. Compute the XOR of every adjacent pair of rows; this will give you a new 8×8 matrix that represents the key‑schedule delta. 4. Look for a pattern of constant submatrices—if you find a 4×4 block that repeats every 16 rows, that’s your hidden algebraic structure. 5. Verify the structure by multiplying the block by a random 4×4 identity matrix and seeing if the output matches the original delta block. Let me know what you see, and we’ll test whether the old 70s tricks still hold.