Skip to main content

Advertisement

Springer Nature Link
Log in

Quantum key-recovery attack on Feistel constructions: Bernstein–Vazirani meet Grover algorithm

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

The development of quantum computers has urged the cryptographic community to prepare cryptographic primitives for the eventual arrival of the post-quantum world. At Asiacrypt 2017, Leander and May combined Grover’s and Simon’s quantum algorithms to break the FX-based block ciphers. Technically this result is based on the combination of the quantum algorithms of Grover’s and Simon’s for the first time in the cryptographic setting. In this study, we using Bernstein–Vazirani’s and Grover’s algorithms to generate a new quantum key-recovery attacks on different rounds of Feistel constructions. An advantage of our attack is the keys can be divided into multiple blocks to enter the S-box and realize the process of recovery; this method greatly reduces the complexity of key recovery. Hence, it has strong practicability for key recovery (e.g., DES, Camellia, etc.). In order to show that, a detailed process has been provided in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)

    Article  MathSciNet  Google Scholar 

  2. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978)

    Article  MathSciNet  Google Scholar 

  3. Grover, L.K.: Quantum computers can search arbitrarily large databases by a single query. Phys Rev Lett 79(23), 4709 (1997)

    Article  ADS  Google Scholar 

  4. Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: IEEE international symposium on information theory, IEEE (2010)

  5. Simon, Daniel R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474–1483 (1997)

    Article  MathSciNet  Google Scholar 

  6. Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. J. Cryptol. 10(3), 151–161 (1997)

    Article  MathSciNet  Google Scholar 

  7. Kuwakado, H., Morii, M.: In: Security on the quantum-type even-mansour cipher. Honolulu , pp. 312–316 (2012)

  8. Kaplan, M., Leurent, G., Leverrier, A., et al.: Breaking symmetric cryptosystems using quantum period finding. In: Advances in Cryptology: CRYPTO 2016. Springer-Verlag, Berlin, pp. 207–237 (2016)

  9. Kaplan, M.: Quantum attacks against iterated block ciphers. Mat. Vopr. Kriptogr. 7(2), 71–90 (2016)

    Article  MathSciNet  Google Scholar 

  10. Kaplan, M., Leurent, G., Leverrier, A., et al.: Quantum differential and linear cryptanalysis. Comput. Sci., pp. 71–94 (2017)

  11. Dong, X., Wang, X.: Quantum key-recovery attack on Feistel structures. Sci. China (Inf. Sci.) 61(102501), 1–7 (2018)

    Google Scholar 

  12. Hosoyamada, A., Yu, S.: Quantum Demiric-Seluk Meet-in-the-Middle Attacks: Applications to 6-Round Generic Feistel Constructions. Security and Cryptography for Networks, pp. 386–403 (2018)

  13. Bernstein, E., Vazirani, U., et al.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411–1473 (1997)

    Article  MathSciNet  Google Scholar 

  14. Li, H.W., Yang, L.: Quantum differential cryptanalysis to the block ciphers. In: International conference on applications and techniques in information security, pp. 44–51 (2015)

  15. Sylvie, Dubuc: Characterization of linear structures. Des. Codes Cryptogr. 22(1), 33–45 (2001)

    Article  MathSciNet  Google Scholar 

  16. Li, H.W., Yang, L.: A quantum algorithm to approximate the linear structures of Boolean functions. Math. Struct. Comput. Sci. 28, 1–13 (2018)

    Article  MathSciNet  Google Scholar 

  17. Xie, H., Yang, L.: Using Bernstein-Vazirani algorithm to attack block ciphers. Des. Codes Cryptogr. 87(5), 1161–1182 (2019)

    Article  MathSciNet  Google Scholar 

  18. Xie, H., Yang, L.: A quantum related-key attack based on Bernstein-Vazirani algorithm (2018). arXiv:1808.03266 [quantph]

  19. Nyberg, K.: Constructions of bent functions and difference sets. In: EUROCRYPT, pp. 151–160 (1990)

  20. Brassard, G., Hoyer, P., Mosca, M., et al.: Quantum amplitude amplification and estimation. AMS Contemp. Math. 305, 53–74 (2002)

    Article  MathSciNet  Google Scholar 

  21. Dinur, I., Dunkelman, O., Keller, N., et al.: New attacks on Feistel structures with improved memory complexities. In: Advances in Cryptology: CRYPTO 2015, Part I. Springer, Berlin, pp. 433–454 (2015)

  22. Leander, G., May, A.: Grover meets simon—quantumly attacking the FX-construction. In: Advances in Cryptology: ASIACRYPT 2017, Part II. Springer, Berlin, pp. 161–178 (2017)

  23. Lub, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373–386 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by the 13th Five-Year National Cryptographic Fund, No. MMJJ20180217.

Author information

Authors and Affiliations

  1. College of Cybersecurity, University of Science and Technology of China, Hefei, 230026, China

    Bao-Min Zhou & Zheng Yuan

  2. Beijing Electronic Science Technology Institute, Beijing, 100070, China

    Bao-Min Zhou & Zheng Yuan

  3. College of Cybersecurity, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Zheng Yuan

Authors
  1. Bao-Min Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zheng Yuan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zheng Yuan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, BM., Yuan, Z. Quantum key-recovery attack on Feistel constructions: Bernstein–Vazirani meet Grover algorithm. Quantum Inf Process 20, 330 (2021). https://doi.org/10.1007/s11128-021-03256-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-021-03256-0

Keywords