Skip to main content
SpringerLink
Log in

Breaking tweakable enciphering schemes using Simon’s algorithm

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We show the applicability of Simon’s period finding quantum algorithm to the cryptanalysis of several tweakable enciphering schemes (TESs), namely, CMC, EME, XCB, TET and FAST. For all of the five TESs, we show distinguishing attacks, while for XCB, TET and FAST, the attacks reveal portions of the secret keys

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Bonnetain X.: Quantum key-recovery on full AEZ. In: Adams C., Camenisch J. (eds.) Selected Areas in Cryptography - SAC 2017 - 24th International Conference, Ottawa, August 16–18, 2017, Revised Selected Papers, volume 10719 of Lecture Notes in Computer Science, pp 394–406. Springer (2017).

  2. Bonnetain X., Hosoyamada A., Naya-Plasencia M., Sasaki Yu., Schrottenloher A.: Quantum attacks without superposition queries: the offline Simon’s algorithm. In: Galbraith SD, Moriai S (eds.) Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part I, volume 11921 of Lecture Notes in Computer Science, pp 552–583. Springer (2019).

  3. Chakraborty D., Ghosh S., Mancillas López C., Sarkar P.: FAST: disk encryption and beyond. Advances in Mathematics of Communications. https://www.aimsciences.org/article/doi/10.3934/amc.2020108.

  4. Dong X., Dong B., Wang X.: Quantum attacks on some Feistel block ciphers. Des. Codes Cryptogr. 88(6), 1179–1203 (2020).

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  6. Grover L.K.: A fast quantum mechanical algorithm for database search. In: Miller GL (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, May 22–24, pp 212–219 ACM (1996).

  7. Halevi S.: \(\text{EME}^{*}\): Extending EME to handle arbitrary-length messages with associated data. In: Canteaut A, Viswanathan K (eds.) Progress in Cryptology - INDOCRYPT 2004, 5th International Conference on Cryptology in India, Chennai, December 20–22, 2004, Proceedings, volume 3348 of Lecture Notes in Computer Science, pages 315–327. Springer (2004).

  8. Halevi S.: Invertible universal hashing and the TET encryption mode. In: Menezes A, (ed) Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, August 19–23, 2007, Proceedings, volume 4622 of Lecture Notes in Computer Science, pp 412–429. Springer (2007).

  9. Halevi S., Rogaway: A tweakable enciphering mode. In: Boneh D (ed) Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, August 17–21, 2003, Proceedings, volume 2729 of Lecture Notes in Computer Science, pp 482–499. Springer (2003).

  10. Halevi S., Rogaway: a parallelizable enciphering mode. In: Okamoto T (ed) Topics in Cryptology - CT-RSA 2004, The Cryptographers’ Track at the RSA Conference 2004, San Francisco, February 23–27, 2004, Proceedings, volume 2964 of Lecture Notes in Computer Science, pp 292–304. Springer (2004)

  11. IEEE Std 1619.2-2010: IEEE standard for wide-block encryption for shared storage media. http://standards.ieee.org/findstds/standard/1619.2-2010.html (2011).

  12. Kaplan M., Leurent G., Leverrier A., Naya-Plasencia M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw M, Katz J (eds.) Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, August 14–18, 2016, Proceedings, Part II, volume 9815 of Lecture Notes in Computer Science, pp 207–237. Springer (2016).

  13. Kuwakado H., Morii M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: IEEE International Symposium on Information Theory, ISIT 2010, June 13–18, 2010, Austin, Proceedings, pp 2682–2685. IEEE (2010).

  14. Kuwakado H., Morii M.: Security on the quantum-type even-mansour cipher. In: Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, October 28–31, 2012, pp 312–316. IEEE (2012)

  15. McGrew DA, Fluhrer SR: The extended codebook (XCB) mode of operation. IACR Cryptol. ePrint Arch. 2004:278 (2004).

  16. McGrew DA, Fluhrer SR: The security of the extended codebook (XCB) mode of operation. In: Adams CM, Miri A, Wiener MJ (eds.) Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, August 16–17, 2007, Revised Selected Papers, volume 4876 of Lecture Notes in Computer Science, pp 311–327. Springer (2007)

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We are grateful to the reviewers for their kind comments which have helped in improving the paper.

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 203, B.T. Road, Kolkata, 700108, India

    Sebati Ghosh & Palash Sarkar

Authors
  1. Sebati Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Palash Sarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebati Ghosh.

Additional information

Communicated by M. Albrecht.

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

Ghosh, S., Sarkar, P. Breaking tweakable enciphering schemes using Simon’s algorithm. Des. Codes Cryptogr. 89, 1907–1926 (2021). https://doi.org/10.1007/s10623-021-00893-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-021-00893-5

Keywords

Mathematics Subject Classification

Search

Navigation