On a Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-Boxes

Yuri Borissov 1 , Peter Boyvalenkov 1 , and Robert Tsenkov 1
  • 1 Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria


We investigate the effect of inserting extra linearity in the Data Encryption Standard (DES) through appropriate nonsingular linear encodings of the output of the individual S-boxes. More specifically, we examine the general situation when the output of each S-box of the DESis precoded separately intoaproperly constructed copy of the inherent even-weight code of length 4. The study is focused on finding multi-round linear characteristics for thus modified DESciphers having maximal effectiveness. Depending on the particular encodings, it turns out that the effectiveness of interest may be larger but in most cases is smaller than that one for the original DESwith the same number of rounds. The latter means that the complexity of successful linear cryptanalysis against these ciphers will mainly increase comparing to the DESitself. The present research extends inanatural way our previous work[Linear Cryptanalysis and Modified DESwith Parity Check in the S-boxes, LNCS 9540 (2016), pp. 60-78].

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • 1. Angelova, V., Y. Borissov. Plaintext Recovery in DES-Like Cryptosystems Based on S-Boxes with Embedded Parity Check. - Serdica Journal of Computing, Vol. 7, 2013, No 3, pp. 257-270.

  • 2. Biham, E., A. Shamir. Differential Cryptanalysis of DES-Like Cryptosystems. - Journal of Cryptology, Vol. 4, 1991, No 1, Springer, pp. 3-72.

  • 3. Borissov, Y., P. Boyvalenkov, R. Tsenko v. Linear Cryptanalysis and Modified DESwith Parity Check in the S-Boxes. - In: 2nd Conference on Cryptography and Information Security in the Balkans, LNCS, Vol. 9540, Springer, 2016, pp. 60-78.

  • 4. Coppersmith, D. The Data Encryption Standard (DES) and Its Strength Against Attacks. - IBM Journal of Research and Development, Vol. 38, 1994, No 3, pp. 243-250.

  • 5. Cusick, T. W., P. Stanic a. Cryptographic Boolean Functions and Applications. San Diego, Academic Press, Elsevier Inc., 2009.

  • 6. Hellman, M., R. Merkle, R. Schroeppel, L. Wash ington, W. Diffie, S. Pohlig, P. Schweitzer. Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard. - SEL 76-042, 9 September 1976.

  • 7. Konheim, A. G. Computer Security and Cryptography. New Jersey, John Wiley & Sons, Inc., 2007.

  • 8. Matsui, M. Linear Cryptanalysis Method of DES Cipher. - Advances in Cryptology-EUROCRYPT’93, LNCS, Vol. 765, Springer, 1994, pp. 386-397.

  • 9. Matsui, M. Linear Cryptanalysis of DES Cipher (I), Version 1.03. http://www.cs.bilkent.edu.tr/~selcuk/teaching/cs519/Matsui-LC.pdf

  • 10. Matsui, M. The First Experimental Cryptanalysis of the Data Encryption Standard. - In: Advances in Cryptology-CRYPTO’94, LNCS, Vol. 839, Springer, 1994, pp. 1-11.

  • 11. Nyberg, K. On the Construction of Highly Nonlinear Permutation. - In: Advances in Cryptology-EUROCRYPT’92, LNCS, Vol. 658, Springer, 1993, pp. 92-98.

  • 12. Pieprzyk, J., C. Charnes, J. Seberr y. On the Immunity of S-Boxes Against Linear Cryptanalysis. citeseerx.ist.psu.edu

  • 13. Schneier, B. Applied Cryptography. Second Edition. New Jersey, John Wiley & Sons, Inc., 1996.


Journal + Issues