A quantum algorithm using NMR computers to break secret-key cryptosystems
In this paper, we discuss quantum algorithms that, for a given plaintext m(O) and a given ciphertext c(O), will find a secret key, k(O), satisfying c(O) = E(k(O), m(O)), where an encryption algorithm, E, is publicly available. We propose a new algorithm suitable for an NMR (Nuclear Magnetic Resonance) computer based on the technique used to solve the counting problem. The complexity of our algorithm decreases as the measurement accuracy of the NMR computer increases. We discuss the possibility that the proposed algorithm is superior to Grover's algorithm based on initial experimental results.
nmr computer secret-key cryptosystem grover's algorithm secret-key search bulk quantum turing machine