M. Kwan and J. Pieprzyk, \A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-like Cryptosystems," Advances in Cryptology|ASIACRYPT '91, Springer-Verlag, 1993, pp. 237-246.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the bitwise complement of C. This reduces the e#ective keyspace by one bit. DES and LOKI have pairs of keys for which a simple relation exists, for at least a fraction of all plaintexts [Knu95a] Kwan and Pieprzyk describe a technique for locating complementation properties in linear key schedules [KP93]. Two keys are equivalent if they transform all plaintexts identically. This can be considered a special kind of simple relation. TEA TEA [WN95] is an easy to memorize Feistel block cipher. It has a 128 bit master key K 0. 3 , and the key schedule is simple: all odd rounds use K 0 , K 1 as the ....

M. Kwan and J. Pieprzyk, "A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-like Cryptosystems," Advances in Cryptology---ASIACRYPT '91, Springer-Verlag, 1993, pp. 237-246.

....bitwise complement of C. This reduces the effective keyspace by one bit. DES and LOKI have pairs of keys for which a simple relation exists, for at least a fraction of all plaintexts [Knu95a] Kwan and Pieprzyk describe a technique for locating complementation properties in linear key schedules [KP93]. Two keys are equivalent if they transform all plaintexts identically. This can be considered a special kind of simple relation. TEA TEA [WN95] is an easy to memorize Feistel block cipher. It has a 128 bit master key K 0: 3 , and the key schedule is simple: all odd rounds use K 0 ; K 1 as the ....

M. Kwan and J. Pieprzyk, "A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-like Cryptosystems," Advances in Cryptology---ASIACRYPT '91, Springer-Verlag, 1993, pp. 237-246.

....= ICE(P Phi A; K Phi B) Phi C is when A, B, and C have all bits set. This is largely unnecessary, since keyed permutation makes it impossible to exploit complementation weaknesses, but it can t hurt. Each subkey bit should only be dependent on only one key bit. This simplifies the proof [5] that the above two conditions are satisfied. No meet in the middle attacks. This means that, for any round N, all key bits must be used either in the preceeding rounds, or all must be used in the following rounds. Since the F function makes use of 60 key bits per round, each key bit must ....

M. Kwan and J. Pieprzyk, A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-Like Cryptosystems, Advances in Cryptology - ASIACRYPT '91 Proceedings, Springer-Verlag, pp. 237-246, 1991

....(which is of O(2 60 ) as detailed below) and is thus a more successful attack than that reported previously. It has been verified by Biham. This still leaves the full 16 round version of LOKI89 secure, but with a reduced margin against that originally believed. Independently, the authors [10], Biham [5] and the members of the RIPE consortium have discovered a weakness in the LOKI89 key schedule. It results in the generation of 15 equivalent keys for any given key, effectively reducing the key space to 2 60 keys. A complementation property also exists which results in 256 (key, ....

....following equations: RD Phi KRD Phi n:ROT 12(KLD) 0 (1) LD Phi KLD Phi n:ROT 12(KRD) 0 (2) where LD = L 0 Phi L, RD = R 0 Phi R, KLD = KL 0 Phi KL, and KRD = KR 0 Phi KR describe the difference between the related (key, plaintext) pairs. This method is detailed by Kwan in [10]. In the light of these results, the authors have devised some additional design guidelines to those originally used in the design of LOKI, and have applied them in the development of a new version, LOKI91. 4 Redesign of LOKI 4.1 Some Additional Design Guidelines To improve the resistance of a ....

M. Kwan and J. Pieprzyk, "A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-style Cryptosystems," in Advances in Cryptology - Asiacrypt'91 (Lecture Notes in Computer Science), vol. 739. Berlin: Springer Verlag, pp. 237--246, 1993.

No context found.

M. Kwan and J. Pieprzyk, \A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-like Cryptosystems," Advances in Cryptology|ASIACRYPT '91, Springer-Verlag, 1993, pp. 237-246.

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