New Generation Computing, 21(2003)347-361
Ohmsha, Ltd. and Springer-Verlag
Received 31 August 2002
Revised manuscript received 30 April 2003
In this paper, we discuss quantum algorithms that, for a given plaintext mo and a given ciphertext co, will find a secret key, ko, satisfying co = E(ko, mo), 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.
Keywords: Grover's Algorithm, Secret-Key Cryptosystem,
Secret-Key Search, NMR Computer, Bulk Quantum Turing Machine.