Academia.eduAcademia.edu

New Lightweight DES Variants

2007, Lecture Notes in Computer Science

Abstract

In this paper we propose a new block cipher, DESL (DES Lightweight), which is based on the classical DES (Data Encryption Standard) design, but unlike DES it uses a single S-box repeated eight times. 1 On this account we adapt well-known DES S-box design criteria, such that they can be applied to the special case of a single S-box. Furthermore, we show that DESL is resistant against certain types of the most common attacks, i.e., linear and differential cryptanalyses, and the Davies-Murphy attack. Our hardware implementation results of DESL are very promising (1848 GE), therefore DESL is well suited for ultraconstrained devices such as RFID tags.

Key takeaways

  • Due to Z 2 = Y 1 and the property of the P-permutation, which distributes the output bits of one S-box to 6 different S-Boxes in the next round, it must hold that |Y 1 | = |Z 2 | = 1.
  • For an n round iterative linear approximation with only one S-box involved in each round (denoted as Type-I by Matsui) our condition 3 ensures that if more than 7 S-boxes are involved in total the approximation will not be useful for an attack as ε ≤ 2 6 4 128 7 = 2 −29 (4)
  • The DESL S-box has been randomly generated in the set of all S-boxes fulfilling the design criteria described above.
  • In our DESL algorithm this S-box is repeated eight times and replaces all eight S-boxes in DES.
  • We substituted the eight original DES S-boxes by a single but cryptographically stronger S-box (see Table 2), which is repeated eight times.