Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 8/2021

27-05-2021

Breaking tweakable enciphering schemes using Simon’s algorithm

Authors: Sebati Ghosh, Palash Sarkar

Published in: Designs, Codes and Cryptography | Issue 8/2021

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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
previous article Security analysis of Subterranean 2.0
next article Tag-based ABE in prime-order groups via pair encoding
Literature
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.
4.
Dong X., Dong B., Wang X.: Quantum attacks on some Feistel block ciphers. Des. Codes Cryptogr. 88(6), 1179–1203 (2020).MathSciNetCrossRef
5.
Dong X., Wang X.: Quantum key-recovery attack on Feistel structures. Sci. China Inf. Sci. 61(10), 102501:1–102501:17 (2018).CrossRef
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.
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).MathSciNetCrossRef
18.
Metadata
Title
Breaking tweakable enciphering schemes using Simon’s algorithm
Authors
Sebati Ghosh
Palash Sarkar
Publication date
27-05-2021
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 8/2021
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-021-00893-5

Other articles of this Issue 8/2021

Designs, Codes and Cryptography 8/2021 Go to the issue

OriginalPaper

A family of projective two-weight linear codes

Correction

Correction to: Good polynomials for optimal LRC of low locality

OriginalPaper

Scattered subspaces and related codes

OriginalPaper

Hamming weight distributions of multi-twisted codes over finite fields

OriginalPaper

Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity

OriginalPaper

Tag-based ABE in prime-order groups via pair encoding

Premium Partner

    Image Credits