VIOLET: A Cascade Electromechanical Cipher Machine

This paper presents a rigorous mathematical and cryptographic treatment of Violet, a novel cascade electromechanical cipher architecture that composes a reflectorless rotor permutation stage with an independent stepping-switch permutation stage, yielding a time-varying polyalphabetic substitution cipher over the symmetric group S₂₆ of the 26-letter Latin alphabet. The system is formally modeled as a deterministic finite-state machine whose encryption function at each discrete time step is the composition of two independently evolving permutations drawn from S₂₆. A complete algebraic framework is developed within the theory of symmetric groups, cyclic groups, and wreath products, enabling formal proofs of structural properties including closure under composition, generic non-reciprocity of the cipher transformation, the existence of fixed points in accordance with classical derangement theory, and a period theorem establishing that the global period of the machine equals the least common multiple of the independent rotor and stepping-switch cycles. A full keyspace derivation is carried out, and for a canonical machine instance comprising five rotors, six stepping switches, and a ten-pair plugboard, the total keyspace is computed to exceed 2¹¹¹ possible operational keys, yielding an effective key entropy of approximately 111 bits—substantially exceeding both the three-rotor Enigma (≈ 2⁷⁷) and the Japanese Purple machine (≈ 2⁶⁰). The statistical mixing behaviour of the composite cipher is analyzed through the lens of ergodic theory on finite groups, demonstrating that over sufficiently long message lengths the distribution of output permutations converges to approximate uniformity on S₂₆, with the rate of convergence governed by the spectral gap of the associated random walk on the Cayley graph. A detailed cryptanalytic assessment is provided, demonstrating that the cascade architecture resists Bombe-style cribs, cycle-structure attacks, and depth attacks, while a formal meet-in-the-middle analysis establishes that the two-stage composition does not admit efficient decomposition attacks unless the attacker can enumerate an intermediate permutation space of order 26! ≈ 4.03 × 10²⁶, rendering such attacks computationally infeasible.The mechanical realizability of the design using mid-twentieth-century electromechanical components—including Strowger stepping switches, wired rotor drums, and relay-driven logic—is discussed in detail, establishing Violet as a historically plausible cipher system that would have represented a significant advance over contemporaneous machines.