In this paper, we discuss quantum algorithms that finds a secret key k{sub}0 satisfying c{sub}0 ＝ E(k{sub}0, m{sub}0) given m{sub}0 and C{sub}0, where an encryption algorithm E is publicly available, k{sub}0 is a secret key, m{sub}0 is plaintexts and c{sub}0 is ciphertexts. We will propose a new algorithm suitable for implementation by BQTM (including NMR) based on the technique to solve the counting problem. It has the trade-off between the complexity of the number of the oracles calls and the measurement accuracy of NMR by introducing a Boolean function Fr(d). The complexity is conjectured under the reasonable assumptions, and the small experimental results are reported.
展开▼
