Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Can we replace the XOR operation in the DES algorithm with some other operation? If so, does it work for both encryption and decryption?

share|improve this question
    
Which XOR are you talking about? The XOR in the function F? The XOR done in each round? Or the XOR when using some mode of encryption? –  mikeazo Feb 10 '13 at 13:06
    
i mean the both the xor operations in function F,XOR in each round in DES –  Nandy Feb 10 '13 at 13:09
1  
If xor is used somewhere in encryption, that effect is reversed in decryption with xor. Similarly addition mod 2n can be reversed with subtraction mod 2n. So you could use instead of xor the modular addition. But the result isn't DES and I don't know what severe adverse effects one obtains with that kind of modification to DES. –  Mok-Kong Shen Feb 10 '13 at 19:11
1  
What do you want to achieve with that change? There are many ways to change DES, but most of them are not a good idea. –  CodesInChaos Feb 10 '13 at 20:28

1 Answer 1

Within the DES block cipher itself, the XOR operation is used at two different places:

  1. On the input of S-boxes, XOR-ing 48 bits per round: 48 bits from a subkey (extracted from the 56-bit key), and 48 bits that are the output of expansion E. The 48-bit result forms the eight 6-bit inputs of the S-boxes.
  2. On the output of S-boxes, XOR-ing 32 bits per round: 32 bits from the former (left) half of the state, and 32 bits formed by the eight 4-bit outputs of the S-boxes. The 32-bit result forms the new (right) half of the state.

If in 1 XOR is replaced by addition modulo 248 (or eight additions modulo 26), in both encryption and decryption, the cipher remains operative, in the sense that decryption remains the reverse of encryption. For something comparable in 2, XOR can be replaced with addition modulo 232 (or eight additions modulo 24) during encryption, and subtraction during decryption (with the negated input being the output of S-boxes). For interoperability, such changes would need to define unambiguously the limits and ordering of input and output bits.

Any of these changes would remove one notable property of DES: the complementation property, stating that $\operatorname{DES}_\overline K(\overline P)=\overline{\operatorname{DES}_K(P)}$. Depending on context, that could be neutral (e.g. with any bit in plaintext fixed), a benefit (e.g. adding one bit of resistance to brute force), or a disaster (e.g. when the complementation property is part of a strategy against side channel attacks).

These changes would potentially slow down implementations of DES, both in hardware (due to carry propagation) and software (by breaking common optimizations).

The impact on security is debatable. Only one thing is obvious: the S-boxes have been carefully designed in a context with XOR for near-optimal resistance to differential cryptanalysis (and later found fair against other attacks), thus we'd be moving into uncharted territory. Resistance against side-channel attacks could be lessened, even without consideration for the lost complementation property. I would be surprised if practical security was otherwise lessened under the assumption of a single unknown key, but would not bet on related-key attacks, or firmly commit on anything.

All in all, I see no good rationale for such change.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.