A key-schedule weakness in SAFER K-64

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 963, Issue , 1995, Pages 274-286

  Knudsen, Lars R ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BLOCK CIPHERS; CHOSEN PLAINTEXTS; CHOSEN-PLAINTEXT ATTACK; CIPHERTEXTS; RELATED KEYS; SECURE HASH;

CRYPTOGRAPHY;

EID: 84949229156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_22     Document Type: Conference Paper

References (11)

1. E. Biham. New types of cryptanalytic attacks using related keys. Journal of Cryptology, 7(4):229-246, 1994.
2. C. Harpes, G.G. Kramer, and J.L. Massey. A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma. In L. Guillou and J.-J. Quisquater, editors, Advances in Cryptology-Eurocrypt'95, LNCS 921, pages 24-38. Springer Verlag, 1995.
3. L.R. Knudsen. Cryptanalysis of LOKI'91. In J. Seberry and Y. Zheng, editors, Advances in Cryptology, AusCrypt 92, LNCS 718, pages 196-208. Springer Verlag, 1993.
4. L.R. Knudsen. Block Ciphers - Analysis, Design and Applications. PhD thesis, Aarhus University, Denmark, 1994.
5. X. Lai. On the Design and Security of Block Ciphers. PhD thesis, ETH, Zürich, Switzerland, 1992.
6. J.L. Massey. SAFER K-64: A byte-oriented block-ciphering algorithm. In Fast Software Encryption-Proc. Cambridge Security Workshop, Cambridge, U.K., LNCS 809, pages 1-17. Springer Verlag, 1994.
7. J.L. Massey. SAFER K-64: One year later. In Proc.-The Leuven Algorithms Workshop. Springer Verlag, 1995. To appear.
8. B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, January 1993.
9. B. Preneel. Hash functions based on block ciphers: A synthetic approach. In D.R. Stinson, editor, Advances in Cryptology-Proc. Crypto'93, LNCS 773, pages 368-378. Springer Verlag, 1993.
10. J.-J. Quisquater and J.-P. Delescaille. How easy is collision search. Applications to DES. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology - Eurocrypt '89, LNCS 434, pages 429-433. Springer Verlag, 1990.
11. S. Vaudenay. On the need for multipermutations: Cryptanalysis of MD4 and SAFER. In Proc.-The Leuven Algorithms Workshop. Springer Verlag, 1994. To appear.