Skip to main content
Erschienen in: Applicable Algebra in Engineering, Communication and Computing 4/2017

20.05.2017 | Original Paper

Mirror theory and cryptography

verfasst von: Jacques Patarin

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 4/2017

Einloggen

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

search-config
loading …

Abstract

“Mirror Theory” is the theory that evaluates the number of solutions of affine systems of equalities \(({=})\) and non equalities (\(\ne \)) in finite groups. It is deeply related to the security and attacks of many generic cryptographic secret key schemes, for example random Feistel schemes (balanced or unbalanced), Misty schemes, Xor of two pseudo-random bijections to generate a pseudo-random function etc. In this paper we will assume that the groups are abelian. Most of time in cryptography the group is \(((\mathbb {Z}/2\mathbb {Z})^n, \oplus )\) and we will concentrate this paper on these cases. We will present here general definitions, some theorems, and many examples and computer simulations.

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 "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!

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!

Literatur
2.
Zurück zum Zitat Patarin, J.: Security of random Feistel schemes with 5 or more rounds. In: Proceedings of Advances in Cryptology—CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, CA, August 15–19, 2004, pp. 106–122 (2004) Patarin, J.: Security of random Feistel schemes with 5 or more rounds. In: Proceedings of Advances in Cryptology—CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, CA, August 15–19, 2004, pp. 106–122 (2004)
3.
Zurück zum Zitat Patarin, J.: On linear systems of equations with distinct variables and small block size. In: 8th International Conference on Information Security and Cryptology—ICISC 2005, Seoul, December 1–2, 2005, Revised Selected Papers, pp. 299–321 (2005) Patarin, J.: On linear systems of equations with distinct variables and small block size. In: 8th International Conference on Information Security and Cryptology—ICISC 2005, Seoul, December 1–2, 2005, Revised Selected Papers, pp. 299–321 (2005)
4.
Zurück zum Zitat Patarin, J.: The “coefficients H” technique. In: 15th International Workshop on Selected Areas in Cryptography, SAC 2008, Sackville, New Brunswick, August 14–15, Revised Selected Papers, pp. 328–345 (2008) Patarin, J.: The “coefficients H” technique. In: 15th International Workshop on Selected Areas in Cryptography, SAC 2008, Sackville, New Brunswick, August 14–15, Revised Selected Papers, pp. 328–345 (2008)
5.
Zurück zum Zitat Patarin, J.: A proof of security in O(2\({}^{\text{n}}\)) for the Xor of two random permutations. In: Proceedings of Third International Conference on Information Theoretic Security, ICITS 2008, Calgary, August 10–13, 2008, pp. 232–248 (2008) Patarin, J.: A proof of security in O(2\({}^{\text{n}}\)) for the Xor of two random permutations. In: Proceedings of Third International Conference on Information Theoretic Security, ICITS 2008, Calgary, August 10–13, 2008, pp. 232–248 (2008)
6.
Zurück zum Zitat Patarin, J.: A proof of security in O(2\({}^{\text{ n }}\)) for the Xor of two random permutations\(\backslash \backslash \) -proof with the \({H}_\sigma \) technique-. IACR Cryptol. ePrint Arch. 2008, 10 (2008) Patarin, J.: A proof of security in O(2\({}^{\text{ n }}\)) for the Xor of two random permutations\(\backslash \backslash \) -proof with the \({H}_\sigma \) technique-. IACR Cryptol. ePrint Arch. 2008, 10 (2008)
7.
Zurück zum Zitat Patarin, J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptol. ePrint Arch. 2010, 287 (2010) Patarin, J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptol. ePrint Arch. 2010, 287 (2010)
8.
Zurück zum Zitat Patarin, J.: Security of balanced and unbalanced Feistel schemes with linear non equalities. IACR Cryptol. ePrint Arch. 2010, 293 (2010) Patarin, J.: Security of balanced and unbalanced Feistel schemes with linear non equalities. IACR Cryptol. ePrint Arch. 2010, 293 (2010)
9.
Zurück zum Zitat Patarin, J.: Security in O(2\({}^{\text{ n }}\)) for the xor of two random permutationsproof with the standard H technique. IACR Cryptol. ePrint Arch. 2013, 368 (2013) Patarin, J.: Security in O(2\({}^{\text{ n }}\)) for the xor of two random permutationsproof with the standard H technique. IACR Cryptol. ePrint Arch. 2013, 368 (2013)
10.
Zurück zum Zitat Salzborn, F., Szekeres, G.: A problem in combinatorial group theory. Ars Comb. 7, 3–5 (1979)MathSciNetMATH Salzborn, F., Szekeres, G.: A problem in combinatorial group theory. Ars Comb. 7, 3–5 (1979)MathSciNetMATH
Metadaten
Titel
Mirror theory and cryptography
verfasst von
Jacques Patarin
Publikationsdatum
20.05.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 4/2017
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-017-0326-y

Weitere Artikel der Ausgabe 4/2017

Applicable Algebra in Engineering, Communication and Computing 4/2017 Zur Ausgabe