Skip to main content

2015 | OriginalPaper | Buchkapitel

Quantum Differential Cryptanalysis to the Block Ciphers

verfasst von : Hongwei Li, Li Yang

Erschienen in: Applications and Techniques in Information Security

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Differential cryptanalysis is one of the most popular methods in attacking block ciphers. However, there are still some limitations in traditional differential cryptanalysis. On the other hand, researches of quantum algorithms have made great progress nowadays. This paper proposes two methods to apply quantum algorithms in differential cryptanalysis, and analysis their efficiencies and success probabilities. One method is using quantum algorithm in the high probability differential finding period for every S-Box. The second method is taking the encryption as a whole, using quantum algorithm in this process.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Knudsen, L.R.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196–211. Springer, Heidelberg (1995) CrossRef Knudsen, L.R.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196–211. Springer, Heidelberg (1995) CrossRef
3.
Zurück zum Zitat Biryukov, A.: Impossible differential attack. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, p. 597. Springer, New York (2011) Biryukov, A.: Impossible differential attack. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, p. 597. Springer, New York (2011)
4.
Zurück zum Zitat Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In: Proceedings of the Royal Society of London, Volume A, vol. 439, pp. 553–558 (1992) Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In: Proceedings of the Royal Society of London, Volume A, vol. 439, pp. 553–558 (1992)
5.
Zurück zum Zitat Bernstein, E., Vazirani, U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 11–20. ACM Press, New York (1993) Bernstein, E., Vazirani, U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 11–20. ACM Press, New York (1993)
7.
Zurück zum Zitat Shor, P.W.: Polynomial-time algorithm for prime factorization and discrete logarithms on quantum computer. SIAM J. Comput. 26, 1484–1509 (1997). A primary version appeared in FOCS, 124–134 (1994)MATHMathSciNetCrossRef Shor, P.W.: Polynomial-time algorithm for prime factorization and discrete logarithms on quantum computer. SIAM J. Comput. 26, 1484–1509 (1997). A primary version appeared in FOCS, 124–134 (1994)MATHMathSciNetCrossRef
8.
Zurück zum Zitat Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)CrossRef Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)CrossRef
9.
10.
Zurück zum Zitat Chakraborty, S., Fischer, E., Matsliah, A., de Wolf., R.: New results on quantum property testing. In: FSTTCS, pp. 145–156 (2010) Chakraborty, S., Fischer, E., Matsliah, A., de Wolf., R.: New results on quantum property testing. In: FSTTCS, pp. 145–156 (2010)
11.
Zurück zum Zitat Hillery, M., Anderson, E.: Quantum tests for the linearity and permutation invariance of Boolean functions. Phys. Rev. A 84, 062326 (2011)CrossRef Hillery, M., Anderson, E.: Quantum tests for the linearity and permutation invariance of Boolean functions. Phys. Rev. A 84, 062326 (2011)CrossRef
12.
Zurück zum Zitat Floess, D., Andersson, E., Hillery, M.: Quantum algorithms for testing and learning Boolean functions. Math. Struct. Comp. Sci. 23, 386–398 (2013)MATHMathSciNetCrossRef Floess, D., Andersson, E., Hillery, M.: Quantum algorithms for testing and learning Boolean functions. Math. Struct. Comp. Sci. 23, 386–398 (2013)MATHMathSciNetCrossRef
13.
Zurück zum Zitat Aharonov, D., Jones, V., Landau, Z.: A polynomial quantum algorithm for approximating the Jones polynomial. Algorithmica 55, 395–421 (2009). Preliminary version in Proceedings of the 38th Annual ACM Symposium on Theory of Computing STOC, pp. 427–436 (2006)MATHMathSciNetCrossRef Aharonov, D., Jones, V., Landau, Z.: A polynomial quantum algorithm for approximating the Jones polynomial. Algorithmica 55, 395–421 (2009). Preliminary version in Proceedings of the 38th Annual ACM Symposium on Theory of Computing STOC, pp. 427–436 (2006)MATHMathSciNetCrossRef
14.
Zurück zum Zitat Nakajima, Y., Kawano, Y., Sekigawa, H.: Efficient quantum circuits for approximating the Jones polynomial. Quantum Inf. Comput. 8(5), 489–500 (2008)MathSciNet Nakajima, Y., Kawano, Y., Sekigawa, H.: Efficient quantum circuits for approximating the Jones polynomial. Quantum Inf. Comput. 8(5), 489–500 (2008)MathSciNet
15.
Zurück zum Zitat Li, H.W., Yang, L.: A quantum algorithm to approximate the linear structures of Boolean functions. arXiv:1404.0611v2 [quant-ph], 20 Jan 2015 Li, H.W., Yang, L.: A quantum algorithm to approximate the linear structures of Boolean functions. arXiv:​1404.​0611v2 [quant-ph], 20 Jan 2015
16.
Zurück zum Zitat Roetteler, M., Steinwandt, R.: A note on quantum related-key attacks. Inf. Process. Lett. 115, 40–44 (2015)MATHCrossRef Roetteler, M., Steinwandt, R.: A note on quantum related-key attacks. Inf. Process. Lett. 115, 40–44 (2015)MATHCrossRef
17.
Zurück zum Zitat Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 158–178. Springer, Heidelberg (2014) Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 158–178. Springer, Heidelberg (2014)
18.
Zurück zum Zitat Zhou, Q., Lu, S.F., Zhang, Z.G., Sun, J.: Quantum differential cryptanalysis. Quantum Inf. Process. 14(6), 2101–2109 (2015)MathSciNetCrossRef Zhou, Q., Lu, S.F., Zhang, Z.G., Sun, J.: Quantum differential cryptanalysis. Quantum Inf. Process. 14(6), 2101–2109 (2015)MathSciNetCrossRef
Metadaten
Titel
Quantum Differential Cryptanalysis to the Block Ciphers
verfasst von
Hongwei Li
Li Yang
Copyright-Jahr
2015
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-48683-2_5