Fast Quantum Algorithms of Breaking the Data Encryption Standard

Weng-Long Chang · 2010

It is shown that the time complexity of breaking Data Encryption Standard is O(56) Hadamard gates, O(262272) NOT gates, O(10482) CNOT gates, O(458880) CCNOT gates, O(1) Shor's quantum order-finding algorithm, and O(1) measurement, and the space complexity of breaking Data Encryption Standard is O(3367) quantum bits.

Read the paper · More papers on PaperTik