A Better Key Schedule for DES-like Ciphers

Blumenthal, Uri; Bellovin, Steven Michael

Several DES-like ciphers aren't utilizing their full potential strength, because of the short key and linear or otherwise easily tractable algorithms they use to generate their key schedules. Using DES as example, we show a way to generate round subkeys to increase the cipher strength substantially by making relations between the round subkeys practically intractable.



More About This Work

Academic Units
Computer Science
Published Here
June 28, 2010


PRAGOCRYPT '96. (Prague: CTU Publishing House, 1996).