Skip to main content
SpringerLink
Log in

Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Linear cryptanalysis and differential cryptanalysis are two recently introduced, powerful methodologies for attacking private-key block ciphers. In this paper, we examine the application of these two cryptanalysis techniques to a CAST-like encryption algorithm. It is shown that, when randomly generated substitution boxes (s-boxes) are used in a CAST-like encryption algorithm, the resulting cipher is resistant to both the linear attack and the differential attack.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. M. Adams. A Formal and Practical Design Procedure for Substitution-Permutation Network Cryptosystems. PhD thesis, Queen's University, Kingston, Canada, 1990.

    Google Scholar 

  2. C. M. Adams. Simple and effective key scheduling for symmetric ciphers. In Workshop on Selected Areas of Cryptography (SAC) '94, pages 129–133, Queen's University, Kingston, Ontario, Canada, May 1994.

    Google Scholar 

  3. C. M. Adams and S. E. Tavares. Designing s-boxes resistant to differential cryptanalysis. In Proceedings of 3rd Symposium on the State and Progress of Research in Cryptography, pages 181–190, Rome, Italy, 1994.

  4. E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. New York: Springer-Verlag, 1993.

    Google Scholar 

  5. W. Feller. An Introduction to Probability Theory and its Applications. New York: Wiley, 1968.

    Google Scholar 

  6. H. M. Heys and S. E. Tavares. On the security of the CAST encryption algorithm. In Canadian Conference on Electrical and Computer Engineering, pages 332–335, Halifax, Nova Scotia, Canada, Sept. 1994.

  7. B. S. Kaliski and M. J. B. Robshaw. Linear Cryptanalysis Using Multiple Approximations. In Advances in Cryptology: Proceedings of CRYPTO '94, pages 26–39, Springer-Verlag, Berlin, 1994.

    Google Scholar 

  8. L. R. Knudsen. Block Ciphers — Analysis, Design and Applications. PhD thesis, Aarhus University, Denmark, July 1994.

    Google Scholar 

  9. X. Lai, J. L. Massey, and S. Murphy. Markov Ciphers and Differential Cryptanalysis. In Advances in Cryptology: Proceedings of EUROCRYPT '91, pages 17–38. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  10. J. Lee. An Investigation of Some Security Aspects of the CAST Encryption Algorithm. Master's thesis, Queen's University, Kingston, Ontario, Canada, 1995.

    Google Scholar 

  11. M. Matsui. Linear Cryptanalysis Method for DES Cipher. In Advances in Cryptology: Proceedings of EUROCRYPT '93, pages 386–397. Springer-Verlag, Berlin, 1994.

    Google Scholar 

  12. M. Matsui. The First Experimental Cryptanalysis of the Data Encryption Standard. In Advances in Cryptology: Proceedings of CRYPTO '94, pages 1–11. Springer-Verlag, Berlin, 1994.

    Google Scholar 

  13. W. Meier and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions. In Advances in Cryptology: Proceedings of EUROCRYPT '89, pages 549–562. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  14. R. C. Merkle. Fast software encryption functions. In Advances in Cryptology: Proceedings of CRYPTO '90, pages 476–501. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  15. K. Nyberg. On the Construction of Highly Nonlinear Permutations. In Advances in Cryptology: Proceedings of EUROCRYPT '92, pages 92–98. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  16. National Bureau of Standards. Data Encryption Standard. Federal Information Processing Standard Publication 46, 1977.

  17. B. O'Higgins. BNR leads industry in client/server network security. Telesis, pages 181–190, Feb. 1994.

  18. C. E. Shannon. Communication Theory of Secrecy System. Bell System Technical Journal, volume 28:pages 656–715, 1949.

    Google Scholar 

  19. A. Shimizu and S. Miyaguchi. Fast Data Encryption Algorithm FEAL. In Advances in Cryptology: Proceedings of EUROCRYPT '87, pages 267–278. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  20. M. J. Wiener. Efficient DES key search. Technical Report TR-244, School of Computer Science, Carleton University, Ottawa, Canada, May 1994. (Also presented at the Rump Session of CRYPTO '93).

    Google Scholar 

  21. A. Youssef, S.E. Tavares, S. Mister, and C.A. Adams. Linear Approximation of Injective S-boxes. IEE Electronics Letters, volume 31,no. 25:pages 2165–2166, Dec. 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Queen`s University, Kingston, Ontario, Canada, K7L 3N6

    J. Lee & S.E. Tavares

  2. Faculty of Engineering and Applied Science, Memorial University of Newfoundland, St. John`s, Newfoundland, Canada, A1B 3X5

    H.M. Heys

Authors
  1. J. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H.M. Heys
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S.E. Tavares
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J., Heys, H. & Tavares, S. Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis. Designs, Codes and Cryptography 12, 267–282 (1997). https://doi.org/10.1023/A:1008276912749

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008276912749

Search

Navigation