<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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].</p></abstract>

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].

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

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia,

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

We investigate the effect of inserting extra linearity in the Data Encryption Standard (DES) through appropriate nonsingular linear encodings of the output of...

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

Publié en ligne: 22 déc. 2016

Pages: 3 - 12

DOI: https://doi.org/10.1515/cait-2016-0063

Mots clés
DES, S-boxes, parity check, linear cryptanalysis, linear characteristics

© by Yuri Borissov

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Publié en ligne: 22 déc. 2016

Pages: 3 - 12

DOI: https://doi.org/10.1515/cait-2016-0063

Mots clésDES, S-boxes, parity check, linear cryptanalysis, linear characteristics

© by Yuri Borissov

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mots clés
DES, S-boxes, parity check, linear cryptanalysis, linear characteristics