Name
Title | ||
|---|---|---|
Quantum computing cryptography: Unveiling cryptographic Boolean functions with quantum annealing. |
Abstract | ||
|---|---|---|
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 $mathcal{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, allowing us to naturally encode it in a quantum annealer, which seems to provide a quantum speedup. Additionally, we benchmark small $n$ cases in a D-Wave machine, showing its capacity of devising bent functions, the most relevant set of cryptographic Boolean functions. We have complemented it with local search and chain repair to improve the D-Wave quantum annealer performance related to the low connectivity. This work shows how to codify super-exponential cryptographic problems into quantum annealers and paves the way for reaching quantum supremacy with an adequately designed chip. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Quantum Physics | Symmetric-key algorithm,Boolean function,Quantum,Discrete mathematics,Block cipher,Cryptography,Quantum computer,Quantum annealing,Hash function,Mathematics |
DocType | Volume | Citations |
Journal | abs/1806.08706 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Hu | 1 | 45 | 3.77 |
| Lucas Lamata | 2 | 19 | 4.63 |
| M. Sanz | 3 | 7 | 4.20 |
| Xi Chen | 4 | 250 | 38.97 |
| Xingyuan Chen | 5 | 1 | 3.39 |
| Chao Wang | 6 | 191 | 53.07 |
| Enrique Solano | 7 | 10 | 7.28 |