3-Way
Designer:
Joan Daemen
Published:
1994
References:
- [Def, An] Joan Daemen,
- "Cipher and Hash Function Design, Strategies based on linear and differential cryptanalysis"
- Ph.D. Thesis, Katholieke Universiteit Leuven, March 1995.
- (in particular see chapter 7
- [Def, An] J. Daemen, R. Govaerts, J. Vandewalle,
- "A New Approach to Block Cipher Design,"
- Fast Software Encryption, Cambridge Security Workshop Proceedings, Volume 809 of Lecture Notes in Computer Science (R. Anderson, ed.), pp. 18-32. Springer-Verlag, 1994.
- [Inf] Bruce Schneier
- "Section 14.5 3-Way,"
- Applied Cryptography, Second Edition, John Wiley & Sons, 1996.
- [An] J. Kelsey, B. Schneier, D. Wagner,
- "Key-Schedule Cryptanalysis of 3-WAY, IDEA, G-DES, RC4, SAFER, and Triple-DES",
- Advances in Cryptology - Crypto '96 Proceedings, pp. 237-251. Springer-Verlag, August 1996.
- dule.html>
- [An] J. Kelsey, B. Schneier, D. Wagner,
- "Related-Key Cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA",
- ICICS '97 Proceedings, Springer-Verlag, November 1997.
- ysis.html>
- [Test] Wei Dai,
- Crypto++ 3.0, file 3wayval.dat
- tlib.html>
- Key length: 96 bits.
- Block size: 12 bytes.
Comment:
The byte ordering convention is as follows: within each 12-byte block, the 32-bit words denoted in chapter 7 of Joan Daemen's thesis as (a0, a1, a2), are given in that order. Within each 32-bit word, the bytes are in big-endian order. This is consistent with the four test vectors in Crypto++; note that the same four test vectors are included in Applied Cryptography (page 659) with the words written in the opposite order (i.e. as a2 a1 a0).
For reference, the forth test vector in this set is:
key = <D2F05B5ED6144138CAB920CD>
plaintext = <4059C76E83AE9DC4AD21ECF7>
ciphertext = <478EA8716B13F17C15B155ED>
Security comment:
3-Way is vulnerable to related-key attacks, and therefore it should only be used with keys that are generated by a strong PRNG, or by a source of bits that are sufficiently uncorrelated (such as the output of a hash function).
|