Quantum mechanical meet-in-the-middle search algorithm for Triple-DES

We present a quantum mechanical meet-in-the-middle search algorithm inosculating the quantum computing theory with crypt-analysis method and basing on the Grover’s algorithm and the meet-in-the-middle attack, which can solve the three-key triple-DES in O(56 256) steps and with O(256) memory cost. The computational complexity is apparently reduced, compared with that of the existing algorithms.