Using frequency analysis and Grover’s algorithm to implement known ciphertext attack on symmetric ciphers

Abstract

In this paper we construct quantum circuit implementing known ciphertext attack on symmetric cipher. We assume that plaintext is in natural language and have known letter distribution. Our method allows to find key using one query to (quantum) decryption oracle and has O(\(\sqrt {\left| K \right|} \)) time complexity, where K—set of possible keys.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    D. Boneh, Online course on Cryptography http://coursera.org/course/crypto.

  2. 2.

    Key Search Quantum Circuit Design of AES Cipher, Journal of Southwest Jiaotong University, 2010-02. DOI: CNKI:SUN:XNJT.0.2010-02-023, http://en.cnki.com.cn/Article_en/CJFDTOTAL-XNJT201002023.htm

    Google Scholar 

  3. 3.

    M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information (Cambridge University Press, 2000).

    MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to M. Ziatdinov.

Additional information

Submitted by F. M. Ablayev

Partially supported by Russian Foundation for Basic Research, Grant 12-01-31216.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ziatdinov, M. Using frequency analysis and Grover’s algorithm to implement known ciphertext attack on symmetric ciphers. Lobachevskii J Math 34, 313–315 (2013). https://doi.org/10.1134/S1995080213040148

Download citation

Keywords and phrases

  • Grover’s algorithm
  • frequency analysis
  • known ciphertext attack
  • symmetric ciphers
  • quantum fingerprinting