A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
As the building block in symmetric cryptography, designing Boolean functions satisfying multiple properties is an important problem in sequence ciphers, block ciphers, and hash functions. However, the search of n-variable Boolean functions fulfilling global cryptographic constraints is computationally hard due to the super-exponential size O(2^2^n) of the space. Here, we introduce a codification of the cryptographically relevant constraints in the ground state of an Ising Hamiltonian, allowingarXiv:1806.08706v2 fatcat:japqew5hyfgchjpfb56ujrqacm