GDES

From CryptoDox, The Online Encyclopedia on Cryptography and Information Security

(Redirected from G-DES)
Jump to: navigation, search

Template:Infobox block cipher In cryptography, the Generalized DES Scheme (GDES or G-DES) is a variant of the DES block cipher designed to speed-up the encryption while improving its security. The scheme was proposed by Ingrid Schaumuller-Bichl in 1981.

GDES generalizes the Feistel network structure of DES to larger block sizes. In each round, the DES round function is applied to the rightmost 32-bit subblock, and the result is XORed with all the other parts. Then the block is rotated 32 bits to the right.

In 1990, Eli Biham and Adi Shamir showed that GDES was vulnerable to differential cryptanalysis, and that any GDES variant faster than DES is also less secure than DES.

References

  • Eli Biham, Adi Shamir: Differential Cryptanalysis of DES-like Cryptosystems. CRYPTO 1990: 2-21
  • Ingrid Schaumuller-Bichl, Zur Analyse des Data Encryption Standard und Synthese Verwandter Chiffriersysteme, Ph.D. Thesis, Linz university, May 1981. (In German).
  • I. Schaumuller-Bichl, "On the Design and Analysis of New Cipher Systems Related to DES," Technical Report, Linz University, 1983.
  • {{{author}}}, {{{year}}}, Applied Cryptography, Second Edition, John Wiley & Sons, {{{location}}}


CryptoDox This article is a part of CryptoDox, an attempt to build an Online Encyclopedia on Cryptography and Information Security. You are seeing this box on this page since we believe this is a stub page. Create an account for yourself on this website and start contributing content.

Template:Crypto navbox