{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:45Z","timestamp":1725565245135},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221234"},{"type":"electronic","value":"9783540248446"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24844-6_94","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T03:21:19Z","timestamp":1284175279000},"page":"622-627","source":"Crossref","is-referenced-by-count":0,"title":["An Empirical Test Suite for Message Authentication Evaluation in Communications Based on Support Vector Machines"],"prefix":"10.1007","author":[{"given":"D. A.","family":"Karras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"94_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I.B. Damgard","year":"1988","unstructured":"Damgard, I.B.: Collision Free Hash Functions and Public Key Signature Schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"key":"94_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damgard","year":"1990","unstructured":"Damgard, I.B.: A Design Principle for Hash Functions\u2019, Advances in Cryptography. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"94_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/ett.4460050406","volume":"5","author":"B. Preenel","year":"1994","unstructured":"Preenel, B.: Cryptographic Hash Functions. Transactions on Telecommunications\u00a05, 431\u2013448 (1994)","journal-title":"Transactions on Telecommunications"},{"key":"94_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Quality. J. of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"J. of Computer and System Sciences"},{"key":"94_CR5","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography. John Wiley and Sons, Chichester (1996)"},{"issue":"2","key":"94_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-4048(97)82016-0","volume":"17","author":"M. Peyravian","year":"1998","unstructured":"Peyravian, M., Roginsky, A., Kshemkalyani, A.: On Probabilities of Hash Value Matches. J. Computers & Security\u00a017(2), 171\u2013176 (1998)","journal-title":"J. Computers & Security"},{"key":"94_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","volume":"48","author":"D. Stinson","year":"1994","unstructured":"Stinson, D.: Combinatorial Techniques for Universal Hashing. J. of Computer and System Sciences\u00a048, 337\u2013346 (1994)","journal-title":"J. of Computer and System Sciences"},{"key":"94_CR8","volume-title":"Network and Internetwork Security","author":"W. Stallings","year":"1995","unstructured":"Stallings, W.: Network and Internetwork Security. Prentice Hall, Englewood Cliffs (1995)"},{"key":"94_CR9","volume-title":"Security in Computing","author":"C.P. Pfleeger","year":"1997","unstructured":"Pfleeger, C.P.: Security in Computing. Prentice Hall, Englewood Cliffs (1997)"},{"key":"94_CR10","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G.J. Simmons","year":"1992","unstructured":"Simmons, G.J.: Contemporary Cryptology, The Science of Information Integrity. IEEE Press, Los Alamitos (1992)"},{"key":"94_CR11","unstructured":"FIPS PUB 180-1, Secure Hash Standard (1995)"},{"issue":"2","key":"94_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-4048(98)00011-X","volume":"17","author":"E.P. Dawson","year":"1998","unstructured":"Dawson, E.P., Gustafson, H.M.: A method for measuring entropy of symmetric cipher key generators. J. of Computers & Security\u00a017(2), 177\u2013184 (1998)","journal-title":"J. of Computers & Security"},{"key":"94_CR13","volume-title":"Neural Networks. A Comprehensive Foundation","author":"S. Haykin","year":"1999","unstructured":"Haykin, S.: Neural Networks. A Comprehensive Foundation. Prentice Hall, Englewood Cliffs (1999)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing - ICAISC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24844-6_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:14:58Z","timestamp":1620011698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24844-6_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221234","9783540248446"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24844-6_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}