Skip to main content

Foundations of Differential Cryptanalysis in Abelian Groups

  • Conference paper
  • 667 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2851))

Abstract

Differential cryptanalysis is based on differentials having relatively high probability. Hawkes and O’Connor studied maximal differential probabilities for three most common operations used as components in ciphers: XOR, modular addition and modular multiplication. They showed that the upper bound for these probabilities for two latter operations is actually a lower bound for maximal probabilities of differentials based on XOR. In this paper we analyse such bounds in abelian groups of odd order and generalize Hawkes and O’Connor’s result. We show that for all operations in these groups the upper bound is the same as for addition mod 2n. This means that no odd order abelian group leads to such high probabilities of differentials as in an abelian group with XOR operation.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biggs, N.L.: Discrete Mathematics. Oxford Science Publications (1985)

    Google Scholar 

  2. 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. 1–11. Springer, Heidelberg (1994)

    Google Scholar 

  3. Biham, E., Dunkelman, O., Keller, N.: The Rectangle Attack - Rectangling Serpent. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 340. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Biham, E., Shamir, A.: Differential cryptanalysis of the full 16-round DES, Techical Report 708, Technion, Israel Institute of Technology, Haifa (1991)

    Google Scholar 

  5. Biham, E., Shamir, A.: Differential cryptanalysis of the full 16-round DES. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 494–502. Springer, Heidelberg (1993)

    Google Scholar 

  6. Biham, E., Shamir, A.: Differential cryptanalysis of snefru, khafre, REDOC-II, LOKI and lucifer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 151–171. Springer, Heidelberg (1992)

    Google Scholar 

  7. Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, New York (1993)

    MATH  Google Scholar 

  8. Daemen, J., Rijmen, V.: AES Proposal: Rijndael, NIST Advanced Encryption Standard submission

    Google Scholar 

  9. Hawkes, P., O’Connor, L.: XOR and non-XOR differential probabilities. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 272–285. Springer, Heidelberg (1999)

    Google Scholar 

  10. Hawkes, P., O’Connor, L.: Asymptotic bounds on differential probabilities, Research Report RZ 3018, IBM Research Report (1998)

    Google Scholar 

  11. Kelsey, J., Kohno, T., Schneier, B.: Amplified Boomerang Attacks Against Reduced- Round MARS and Serpent, Third AES Candidate Conference (2000)

    Google Scholar 

  12. Knudsen, L.R.: Truncated and Higher Order Differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196–211. Springer, Heidelberg (1995)

    Google Scholar 

  13. Kühn, U.: Cryptanalysis of Reduced-Round MISTY. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 325. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. 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)

    Google Scholar 

  15. Lipmaa, H., Moriai, S.: Efficient Algorithms for Computing Differential Properties of Addition. In: Proceedings of Fast Software Encryption 2001. Springer, Heidelberg (2001)

    Google Scholar 

  16. Lipmaa, H.: On Differential Properties of Pseudo-Hadamard Transform and Related Mappings. In: Proceedings of IndoCrypt 2001. Springer, Heidelberg (2001)

    Google Scholar 

  17. O’Connor, L.: On Distribution of characteristics in bijective mappigns. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 360–370. Springer, Heidelberg (1994)

    Google Scholar 

  18. O’Connor, L.: On Distribution of characteristics in bijective mappigns. Journal of Cryptology 8(2), 67–86 (1995)

    MATH  MathSciNet  Google Scholar 

  19. Wagner, D.: The Boomerang Attack. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol. 1636, pp. 156–170. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tyksiński, T. (2003). Foundations of Differential Cryptanalysis in Abelian Groups. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_22

Download citation

  • DOI: https://doi.org/10.1007/10958513_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20176-2

  • Online ISBN: 978-3-540-39981-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics