Cryptology ePrint Archive: Report 2017/089

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

Yuri Borissov, and Peter Boyvalenkov, and Robert Tsenkov

Abstract: We investigate the effect of inserting extra linearity in the Data Encryption Standard (DES) through appropriate singular 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 DES is precoded separately into a properly constructed copy of the inherent even-weight code of length 4. The study is focused on finding multi-round linear characteristics for thus modified DES ciphers having maximal effectiveness. It turns out, depending on the particular encodings, that the effectiveness of interest may be larger but in most cases is smaller than that one for the original DES with the same number of rounds. The latter means that the complexity of successful linear cryptanalysis against these ciphers will mainly increase comparing to the DES itself. The present research extends in a natural way our previous work [Linear Cryptanalysis and Modified DES with Parity Check in the S-boxes, LNCS 9540 (2016), pp. 60 78].

Category / Keywords: secret-key cryptography / DES, S-boxes, parity check, linear cryptanalysis, linear characteristics.

Original Publication (with minor differences): CYBERNETICS AND INFORMATION TECHNOLOGIES, vol. 16, No 4, 2016
DOI:
10.1515/cait-2016-0063

Date: received 5 Feb 2017

Contact author: youri at math bas bg

Available format(s): PDF | BibTeX Citation

Version: 20170210:150824 (All versions of this report)

Short URL: ia.cr/2017/089

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]