Restricted Boltzmann machine as a probabilistic Enigma

TL;DR

This paper introduces a novel cryptographic scheme using Restricted Boltzmann Machines that leverages probabilistic distributions and permutation keys to provide post-quantum security and efficient decryption for legitimate users.

Contribution

It proposes a new encryption method based on RBMs with permutation keys, offering factorial key space growth and resistance to quantum attacks.

Findings

Key space grows factorially with permutation matrices

Scheme exhibits excellent diffusion properties

Computational complexity resists quantum attacks

Abstract

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 reveals significant advantages including factorial key space growth through permutation matrices, excellent diffusion properties, and computational complexity rooted in sharp P-complete problems that resist quantum attacks. Compatible with emerging probabilistic computing hardware, the scheme establishes an asymmetric computational barrier where legitimate users decrypt efficiently while adversaries face exponential costs. This framework unlocks probabilistic computers' potential for cryptographic systems, offering an emerging encryption paradigm between classical and quantum regimes for post-quantum security.