{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:46Z","timestamp":1725488806833},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642657"},{"type":"electronic","value":"9783540697107"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69710-1_10","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T16:50:55Z","timestamp":1186678255000},"page":"134-149","source":"Crossref","is-referenced-by-count":1,"title":["MRD Hashing"],"prefix":"10.1007","author":[{"given":"Rei","family":"Safavi-Naini","sequence":"first","affiliation":[]},{"given":"Shahram","family":"Bakhtiari","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Charnes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,10,16]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, \u201cUniversal Class of Hash Functions,\u201d Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0032363","volume-title":"Cryptography: Policy and Algorithms Conference","author":"K. Chen","year":"1995","unstructured":"K. Chen, \u201cA New Identification Algorithm,\u201d in Cryptography: Policy and Algorithms Conference (E. Dawson and J. Golic, eds.), vol. 1029 of Lecture Notes in Computer Science (LNCS), (Queensland, Australia), pp. 244\u2013249, Springer-Verlag, July 1995."},{"issue":"1","key":"10_CR3","first-page":"1","volume":"21","author":"E. Gabidulin","year":"1985","unstructured":"E. Gabidulin, \u201cTheory of Codes with Maximum Rank Distance,\u201d Problems of Information Transmission, vol. 21, no. 1, pp. 1\u201312, 1985.","journal-title":"Problems of Information Transmission"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01388475","volume":"6","author":"T. Johansson","year":"1995","unstructured":"T. Johansson, \u201cAuthentication Codes for Nontrusting Parties Obtained from Rank Metric Codes,\u201d Design, Codes and Cryptography, no. 6, pp. 205\u2013218, 1995.","journal-title":"Design, Codes and Cryptography"},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","first-page":"45","volume-title":"Proceedings of Fast Software Encryption Workshop, FSE\u2019 93","author":"H. Krawczyk","year":"1993","unstructured":"H. Krawczyk, \u201cThe Shrinking Generator; some practical consideration,\u201d in Proceedings of Fast Software Encryption Workshop, FSE\u2019 93, pp. 45\u201346, LNCS, Springer-Verlag, 1993."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology, Proceedings of CRYPTO\u2019 94","author":"H. Krawczyk","year":"1994","unstructured":"H. Krawczyk, \u201cLFSR-based Hashing and Authentication,\u201d in Advances in Cryptology, Proceedings of CRYPTO\u2019 94 (Y. G. Desmedt, ed.), vol. 839 of Lecture Notes in Computer Science (LNCS), pp. 129\u2013139, Springer-Verlag, 1994."},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-49264-X_24","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT\u2019 95","author":"H. Krawczyk","year":"1995","unstructured":"H. Krawczyk, \u201cNew Hash Functions for Message Authentication,\u201d in Advances in Cryptology, Proceedings of EUROCRYPT\u2019 95 (L. C. Guillou and J.-J. Quisquater, eds.), Lecture Notes in Computer Science (LNCS), (Berlin), pp. 301\u2013310, 1995."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications. Cambridge Uiversity Press, 1994.","DOI":"10.1017\/CBO9781139172769"},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT\u2019 96","year":"1996","unstructured":"U. Maurer, ed., Advances in Cryptology, Proceedings of EUROCRYPT\u2019 96, vol. 1070 of Lecture Notes in Computer Science (LNCS), (Saragossa), Springer-Verlag, 1996."},{"key":"10_CR10","unstructured":"B. Preneel, Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke University Leuven, Jan. 1993."},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-68339-9_3","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT\u2019 96","author":"B. Preneel","year":"1996","unstructured":"B. Preneel and P. C. van Oorschot, \u201cOn the Security of Two MAC Algorithms,\u201d in Maurer [9], pp. 19\u201332."},{"key":"10_CR12","series-title":"Lect Notes Comput Sci","first-page":"30","volume-title":"Advances in Cryptology, Proceedings of CRYPTO\u2019 95","author":"P. Rogaway","year":"1995","unstructured":"P. Rogaway, \u201cBucket Hashing and its Application to Fast Message Authentication,\u201d in Advances in Cryptology, Proceedings of CRYPTO\u2019 95, Lecture Notes in Computer Science (LNCS), pp. 30\u201342, Springer-Verlag, 1995."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-68339-9_28","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT\u2019 96","author":"V. Shoup","year":"1996","unstructured":"V. Shoup, \u201cOn Fast and Provably Secure Message Authentication Based on Universal Hashing,\u201d in Maurer [9], pp. 321\u2013331."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D. R. Stinson","year":"1994","unstructured":"D. R. Stinson, \u201cUniversal Hashing and Authentication Codes,\u201d Design, Codes and Cryptography, vol. 4, pp. 369\u2013380, 1994.","journal-title":"Design, Codes and Cryptography"},{"key":"10_CR15","series-title":"Lect Notes Comput Sci","first-page":"245","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT\u2019 94","author":"R. Taylor","year":"1994","unstructured":"R. Taylor, \u201cNear Optimal Unconditionally Secure Authentication,\u201d in Advances in Cryptology, Proceedings of EUROCRYPT\u2019 94 (preprints) (W. Wolfowicz and A. de Santis, eds.), vol. 765 of Lecture Notes in Computer Science (LNCS), (Perugia, Italy), pp. 245\u2013255, may 1994."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter, \u201cNew Hash Functions and Their Use in Authentication and Set Equality,\u201d Journal of Computer and System Sciences, vol. 22, pp. 265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69710-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:29:54Z","timestamp":1550708994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69710-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642657","9783540697107"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-69710-1_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}