A quantum algorithm using NMR computers to break secret-key cryptosystems

  • Authors:

  • Kazuo Ohta;Tetsuro Nishino;Seiya Okubo;Noboru Kunihiro

  • Affiliations:

  • The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan;The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan;The Graduate School of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan;The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan

  • Venue:
  • New Generation Computing - Quantum computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we discuss quantum algorithms that, for a given plaintext m0 and a given ciphertext c0, will find a secret key, k0, satisfying c0 = E(k0, m0), 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.