Description
We theoretically propose a symmetric encryption scheme based on Restricted Boltzmann Machines that functions as a probabilistic Enigma device, encoding information in the marginal distributions of visible states while utilizing bias permutations as cryptographic keys. Theoretical analysis demonstrates proven resistance against differential attacks through distribution-based encoding and computational complexity rooted in #P-hard partition function evaluation. Compatible with probabilistic computing hardware, the scheme establishes a physical-computational asymmetry where legitimate users decrypt efficiently while adversaries face exponential-time complexity. Unlike conventional symmetric ciphers on digital computers that collapse immediately upon key exposure, this asymmetry preserves time-limited security even with fully exposed keys. This framework unlocks probabilistic computers' potential for cryptographic systems, offering an emerging encryption paradigm between classical and quantum regimes for post-quantum security.
