Provable Security against Impossible Differential Cryptanalysis Application to CS-Cipher

  • Thomas Roche
  • Roland Gillard
  • Jean-Louis Roch
Part of the Communications in Computer and Information Science book series (CCIS, volume 14)

Abstract

In this document we present a new way to bound the probability of occurrence of an n-round differential in the context of differential cryptanalysis. Hence this new model allows us to claim proof of resistance against impossible differential cryptanalysis, as defined by Biham and al. in 1999. This work will be described through the example of CS-Cipher, to which, assuming some non-trivial hypothesis, provable security against impossible differential cryptanalysis is obtained.

Keywords

Impossible Differential cryptanalysis Provable security Symmetric ciphers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. J. Cryptology 4(1), 3–72 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Lai, X., Massey, J.L., Murphy, S.: Markov ciphers and differential cryptanalysis. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 17–38. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  3. 3.
    Sugita, M., Kobara, K., Uehara, K., Kubota, S., Imai, H.: Relationships among differential, truncated differential, impossible differential cryptanalyses against word-oriented block ciphers like RIJNDAEL, E2. In: AES Candidate Conference, pp. 242–254 (2000)Google Scholar
  4. 4.
    Stern, J., Vaudenay, S.: Cs-cipher. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 189–205. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    Vaudenay, S.: On the security of cs-cipher. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol. 1636, pp. 260–274. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Schnorr, C.P., Vaudenay, S.: Black box cryptanalysis of hash networks based on multipermutations. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 47–57. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  7. 7.
    Schnorr, C.P., Vaudenay, S.: La Sécurité des Primitives Cryptographiques (1995)Google Scholar
  8. 8.
    Biham, E., Biryukov, A., Shamir, A.: Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 12–23. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thomas Roche
    • 1
    • 2
    • 7
  • Roland Gillard
    • 5
    • 2
    • 3
  • Jean-Louis Roch
    • 1
    • 3
    • 4
    • 6
  1. 1.Laboratoire d’Informatique de GrenobleMontbonnot-Saint-MartinFrance
  2. 2.Université Joseph FourierFrance
  3. 3.Grenoble UniversitéFrance
  4. 4.INRIA Rhône-AlpesFrance
  5. 5.Institut FourierSt Martin d’HèresFrance
  6. 6.Institut National Polytechnique de Grenoble (INPG)France
  7. 7.CS, Communication&SystemsLe Plessis RobinsonFrance

Personalised recommendations