{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:17Z","timestamp":1747104197407},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204497"},{"type":"electronic","value":"9783540398875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39887-5_14","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T18:02:13Z","timestamp":1283709733000},"page":"182-191","source":"Crossref","is-referenced-by-count":13,"title":["Analysis of RMAC"],"prefix":"10.1007","author":[{"given":"Lars R.","family":"Knudsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadayoshi","family":"Kohno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Biham, E.: How to decrypt or even substitute DES-encrypted messages in 228 steps. Information Processing Letters\u00a084 (2002)","DOI":"10.1016\/S0020-0190(02)00269-7"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-45661-9_19","volume-title":"Fast Software Encryption","author":"E. Jaulmes","year":"2002","unstructured":"Jaulmes, E., Joux, A., Valette, F.: On the security of randomized CBC-MAC beyond the birthday paradox limit: A new construction. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol.\u00a02365, p. 237. Springer, Heidelberg (2002)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-68697-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"J. Kelsey","year":"1996","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Key-schedule cryptanalysis of IDEA, GDES, GOST, SAFER, and triple-DES. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 237\u2013251. Springer, Heidelberg (1996)"},{"issue":"9","key":"14_CR4","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1049\/el:19980586","volume":"34","author":"L.R. Knudsen","year":"1998","unstructured":"Knudsen, L.R., Preneel, B.: MacDES: a new MAC algorithm based on DES. Electronics Letters\u00a034(9), 871\u2013873 (1998)","journal-title":"Electronics Letters"},{"key":"14_CR5","unstructured":"Mitchell, C.: Private communication"},{"key":"14_CR6","unstructured":"NIST. DRAFT Recommendation for Block Cipher Modes of Operation: the RMAC Authentication Mode. NIST Special Publication 800-38B. October 18 (2002)"},{"issue":"1","key":"14_CR7","first-page":"7","volume":"2","author":"R. Rivest","year":"1996","unstructured":"Rivest, R., Shamir, A.: Payword and Micromint: Two simple micropayment schemes. Cryptobytes\u00a02(1), 7\u201311 (1996)","journal-title":"Cryptobytes"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39887-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:19:55Z","timestamp":1553033995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39887-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204497","9783540398875"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39887-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}