I’ve been exploring a theoretical encryption method inspired by a 3×3 Rubik’s Cube.
Conceptually, it works like this:
The plaintext is written onto the cube’s faces in some systematic order. For example, letters could be placed row by row across the cube’s surfaces. If the message doesn’t fill the cube, extra random letters can be added as padding.
A sequence of moves is then applied to the cube, permuting the positions of the letters. The sequence of moves is logged and acts as the key for decryption.
To decrypt, the moves are applied in reverse, and the letters are read off in the original systematic order to recover the plaintext.
This approach is essentially a permutation-based cipher, where the cube’s states represent different permutations of the letters. Random padding is used to obscure the length and structure of the message.For a 3×3 cube, there are over 43 quintillion possible states, so the system relies on large permutations to provide a theoretical keyspace.
I’m interested in the general cryptographic properties of this type of system.
Specifically:
- What weaknesses exist in permutation-based encryption systems like this?
- How does adding random padding affect security?
- Are there general considerations or pitfalls when using combinatorial or mechanical devices (like a cube) to permute letters in encryption?
I’m not asking for a security audit of a full personal design, just a discussion of theoretical properties that would apply to any system using letter permutations and move sequences like this.