{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:14Z","timestamp":1725489554527},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602217"},{"type":"electronic","value":"9783540447504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:39:53Z","timestamp":1187253593000},"page":"274-286","source":"Crossref","is-referenced-by-count":16,"title":["A Key-schedule Weakness in SAFER K-64"],"prefix":"10.1007","author":[{"given":"Lars R.","family":"Knudsen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00203965","volume":"7","author":"E. Biham","year":"1994","unstructured":"E. Biham. New types of cryptanalytic attacks using related keys. Journal of Cryptology, 7(4):229\u2013246, 1994.","journal-title":"Journal of Cryptology"},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-49264-X_3","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u201995","author":"C. Harpes","year":"1995","unstructured":"C. Harpes, G.G. Kramer, and J.L. Massey. A generalization of linear cryptanalysis and the applicability of Matsui\u2019s piling-up lemma. In L. Guillou and J.-J. Quisquater, editors, Advances in Cryptology \u2014 Eurocrypt\u201995, LNCS 921, pages 24\u201338. Springer Verlag, 1995."},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-57220-1_62","volume-title":"Advances in Cryptology, AusCrypt 92","author":"L.R. Knudsen","year":"1993","unstructured":"L.R. Knudsen. Cryptanalysis of LOKI\u201991. In J. Seberry and Y. Zheng, editors, Advances in Cryptology, AusCrypt 92, LNCS 718, pages 196\u2013208. Springer Verlag, 1993."},{"key":"22_CR4","volume-title":"Block Ciphers \u2014 Analysis, Design and Applications","author":"L.R. Knudsen","year":"1994","unstructured":"L.R. Knudsen. Block Ciphers \u2014 Analysis, Design and Applications. PhD thesis, Aarhus University, Denmark, 1994."},{"key":"22_CR5","volume-title":"On the Design and Security of Block Ciphers","author":"X. Lai","year":"1992","unstructured":"X. Lai. On the Design and Security of Block Ciphers. PhD thesis, ETH, Z\u00fcrich, Switzerland, 1992."},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Fast Software Encryption \u2014 Proc. Cambridge Security Workshop, Cambridge, U.K.","author":"J.L. Massey","year":"1994","unstructured":"J.L. Massey. SAFER K-64: A byte-oriented block-ciphering algorithm. In Fast Software Encryption \u2014 Proc. Cambridge Security Workshop, Cambridge, U.K., LNCS 809, pages 1\u201317. Springer Verlag, 1994."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"J.L. Massey. SAFER K-64: One year later. In Proc.-The Leuven Algorithms Workshop. Springer Verlag, 1995. To appear.","DOI":"10.1007\/3-540-60590-8_17"},{"key":"22_CR8","unstructured":"B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven, January 1993."},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-57341-0","volume-title":"Advances in Cryptology \u2014 Proc. Crypto\u201993","author":"B. Preneel","year":"1993","unstructured":"B. Preneel. Hash functions based on block ciphers: A synthetic approach. In D.R. Stinson, editor, Advances in Cryptology \u2014 Proc. Crypto\u201993, LNCS 773, pages 368\u2013378. Springer Verlag, 1993."},{"key":"22_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 89","author":"J.-J. Quisquater","year":"1990","unstructured":"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 \u2014 Eurocrypt\u2019 89, LNCS 434, pages 429\u2013433. Springer Verlag, 1990."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"S. Vaudenay. On the need for multipermutations: Cryptanalysis of MD4 and SAFER. In Proc.-The Leuven Algorithms Workshop. Springer Verlag, 1994. To appear.","DOI":"10.1007\/3-540-60590-8_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:18:51Z","timestamp":1556770731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]}}}