| E.K. Grossman and B. Tuckerman, \Analysis of a Weakened Feistel-like Cipher," |
....queries are not much more expensive than chosen plaintext queries. Biham introduced a form of related key cryptanalysis of product ciphers based on rotating the round subkeys [Bih94] Grossman and Tuckerman have described an attack on Feistel ciphers with identical subkeys in each round [GT78]. 4 With hindsight, the ideas used in their known plaintext attack seem similar to the general approach of Biham s related key attacks, though their paper predated Biham s by 16 years. Others have used similar techniques to exploit key schedule weaknesses in chosen plaintext attacks [Knu93b] ....
E.K. Grossman and B. Tuckerman, "Analysis of a Weakened Feistel-like Cipher," 1978 International Conference on Communications, Alger Press Limited, 1978, pp. 46.3.1--46.3.5.
....queries are not much more expensive than chosen plaintext queries. Biham introduced a form of related key cryptanalysis of product ciphers based on rotating the round subkeys [Bih94] Grossman and Tuckerman have described an attack on Feistel ciphers with identical subkeys in each round [GT78]. With hindsight, the ideas used in their known plaintext attack seem similar to the general approach of Biham s related key attacks, though their paper predated Biham s by 16 years. Others have used similar techniques to exploit key schedule weaknesses in chosen plaintext attacks [Knu93b] Let ....
E.K. Grossman and B. Tuckerman, "Analysis of a Weakened Feistel-like Cipher," 1978 International Conference on Communications, Alger Press Limited, 1978, pp. 46.3.1--46.3.5.
....specifies how to derive the round subkeys from the encryption key. DES uses a completely linear key schedule; in each round, 48 bits are selected from the 56 bit DES key. If the key schedule were removed and all round subkeys were the same, DES would be vulnerable to a particularly nasty attack [11]. In fact, these attacks have been carefully avoided in the DES key schedule. 2.2 MacGuffin MacGuffin is an example of a generalized unbalanced Feistel cipher (a GUFN) MacGuffin splits the 64 bit plaintext block into four 16 bit registers l, a, b, and c. A representation of one MacGuffin round ....
....MacGuffin key scheduling algorithm 6.1 Weak keys For a variety of reasons, DES has several keys which are especially dangerous. First, these weak keys generate only a few different subkey values. This makes them vulnerable, or more vulnerable than usual, to certain attacks based on related keys [11, 34]. It also raises doubts about the security of those keys on general grounds. Secondly, the encryption and decryption operations are identical for some of the weak keys. With DES, decryption is just encryption with the order of the round subkeys reversed; therefore encryption is self reversing for ....
[Article contains additional citation context not shown here]
Edna K. Grossman and Bryant Tuckerman. Analysis of a weakened Feistel-like cipher. In 1978 International Conference on Communications, pages 46.3.1--46.3.5. Alger Press Limited, 1978.
No context found.
E.K. Grossman and B. Tuckerman, \Analysis of a Weakened Feistel-like Cipher,"
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC