{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:11:53Z","timestamp":1725973913186},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893389"},{"type":"electronic","value":"9783319893396"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89339-6_3","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T01:32:30Z","timestamp":1522891950000},"page":"33-50","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ubiquitous Weak-Key Classes of\u00a0BRW-Polynomial Function"],"prefix":"10.1007","author":[{"given":"Kaiyan","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dingfeng","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/978-3-662-46800-5_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MA Abdelraheem","year":"2015","unstructured":"Abdelraheem, M.A., Beelen, P., Bogdanov, A., Tischhauser, E.: Twisted polynomials and forgery attacks on GCM. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 762\u2013786. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46800-5_29"},{"key":"3_CR2","unstructured":"Abdelraheem, M.A., Bogdanov, A., Tischhauser, E.: Weak-key analysis of poet. Cryptology ePrint Archive, Report 2014\/226 (2014). \nhttp:\/\/eprint.iacr.org\/2014\/226"},{"key":"3_CR3","unstructured":"Abed, F., Fluhrer, S., Foley, J., Forler, C., List, E., Lucks, S., McGrew, D., Wenzel, J.: The POET family of on-line authenticated encryption schemes (2014). \nhttp:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"3_CR4","unstructured":"Andreeva, E., Bogdanov, A., Lauridsen, M.M., Luykx, A., Mennink, B., Tischhauser, E., Yasuda, K.: AES-COBRA (2014). \nhttp:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32\u201349. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11502760_3"},{"key":"3_CR6","unstructured":"Bernstein, D.J.: Polynomial Evaluation and Message Authentication (2011). \nhttp:\/\/cr.yp.to\/papers.html#pema"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: Wiener [38], pp. 216\u2013233 (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48405-1_14","DOI":"10.1007\/3-540-48405-1_14"},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1504\/IJACT.2012.045588","volume":"2","author":"D Chakraborty","year":"2012","unstructured":"Chakraborty, D., Mancillas-L\u00f3pez, C.: Double ciphertext mode: a proposal for secure backup. IJACT 2(3), 271\u2013287 (2012). \nhttps:\/\/doi.org\/10.1504\/IJACT.2012.045588","journal-title":"IJACT"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11941378_21","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"D Chakraborty","year":"2006","unstructured":"Chakraborty, D., Sarkar, P.: HCH: a new tweakable enciphering scheme using the hash-encrypt-hash approach. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 287\u2013302. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11941378_21"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Etzel, M., Patel, S., Ramzan, Z.: SQUARE hash: fast message authenication via optimized universal hash functions. In: Wiener [38], pp. 234\u2013251 (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48405-1_15","DOI":"10.1007\/3-540-48405-1_15"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-319-40367-0_20","volume-title":"Information Security and Privacy","author":"C Forler","year":"2016","unstructured":"Forler, C., List, E., Lucks, S., Wenzel, J.: Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 317\u2013332. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40367-0_20"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0052345","volume-title":"Fast Software Encryption","author":"S Halevi","year":"1997","unstructured":"Halevi, S., Krawczyk, H.: MMH: software message authentication in the Gbit\/second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172\u2013189. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0052345"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85174-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"H Handschuh","year":"2008","unstructured":"Handschuh, H., Preneel, B.: Key-recovery attacks on universal hash function based MAC algorithms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 144\u2013161. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85174-5_9"},{"key":"3_CR15","unstructured":"Harris, S.: The Enchilada authenticated ciphers (2014). \nhttp:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Krovetz, T., Rogaway, P.: Robust authenticated-encryption AEZ and the problem that it solves. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 15\u201344. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46800-5_2"},{"key":"3_CR17","unstructured":"IEEE Std 1619.2-2010: IEEE standard for wide-block encryption for shared storage media (2011)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129\u2013139. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48658-5_15"},{"key":"3_CR19","unstructured":"McGrew, D.A., Fluhrer, S.R.: The extended codebook (XCB) mode of operation. IACR Cryptology ePrint Archive 2004, 278 (2004). \nhttp:\/\/eprint.iacr.org\/2004\/278"},{"key":"3_CR20","unstructured":"McGrew, D.A., Viega, J.: The Galois\/Counter mode of operation (GCM) (2004). \nhttp:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/"},{"key":"3_CR21","unstructured":"McGrew, D.A., Viega, J.: The security and performance of the Galois\/Counter mode of operation (full version). IACR Cryptology ePrint Archive 2004, 193 (2004). \nhttp:\/\/eprint.iacr.org\/2004\/193"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-52153-4_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B.: Weak keys for AEZ, and the external key padding attack. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 223\u2013237. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-52153-4_13"},{"key":"3_CR23","unstructured":"Morales-Luna, G.: On formal expressions of BRW-polynomials. IACR Cryptology ePrint Archive 2013, 3 (2013). \nhttp:\/\/eprint.iacr.org\/2013\/003"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-662-53018-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Peyrin","year":"2016","unstructured":"Peyrin, T., Seurin, Y.: Counter-in-tweak: authenticated encryption modes for tweakable block ciphers. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 33\u201363. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53018-4_2"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-43933-3_15","volume-title":"Fast Software Encryption","author":"G Procter","year":"2014","unstructured":"Procter, G., Cid, C.: On weak keys and forgery attacks against polynomial-based MAC schemes. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 287\u2013304. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43933-3_15"},{"issue":"4","key":"3_CR26","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/cpa.3160250405","volume":"25","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O., Winograd, S.: Fast evaluation of polynomials by rational preparation. Commun. Pure Appl. Math. 25(4), 433\u2013458 (1972)","journal-title":"Commun. Pure Appl. Math."},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-34047-5_13","volume-title":"Fast Software Encryption","author":"M-JO Saarinen","year":"2012","unstructured":"Saarinen, M.-J.O.: Cycling attacks on GCM, GHASH and other polynomial MACs and hashes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 216\u2013225. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34047-5_13"},{"issue":"10","key":"3_CR28","doi-asserted-by":"publisher","first-page":"4749","DOI":"10.1109\/TIT.2009.2027487","volume":"55","author":"P Sarkar","year":"2009","unstructured":"Sarkar, P.: Efficient tweakable enciphering schemes from (block-wise) universal hash functions. IEEE Trans. Inf. Theory 55(10), 4749\u20134760 (2009). \nhttps:\/\/doi.org\/10.1109\/TIT.2009.2027487","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"19","key":"3_CR29","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ipl.2011.06.014","volume":"111","author":"P Sarkar","year":"2011","unstructured":"Sarkar, P.: Tweakable enciphering schemes using only the encryption function of a block cipher. Inf. Process. Lett. 111(19), 945\u2013955 (2011). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2011.06.014","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s12095-013-0097-7","volume":"6","author":"P Sarkar","year":"2014","unstructured":"Sarkar, P.: Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector. Crypt. Commun. 6(3), 189\u2013231 (2014). \nhttps:\/\/doi.org\/10.1007\/s12095-013-0097-7","journal-title":"Crypt. Commun."},{"key":"3_CR31","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive 2004, 332 (2004). \nhttp:\/\/eprint.iacr.org\/2004\/332"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"DR Stinson","year":"1992","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 74\u201385. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/3-540-46766-1_5"},{"key":"3_CR33","unstructured":"Stinson, D.R.: On the connections between universal hashing, combinatorial designs and error-correcting codes. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 2, no. 52 (1995). \nhttp:\/\/eccc.hpi-web.de\/eccc-reports\/1995\/TR95-052\/index.html"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19962-7_1","volume-title":"Information Security and Privacy","author":"Z Sun","year":"2015","unstructured":"Sun, Z., Wang, P., Zhang, L.: Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes. In: Foo, E., Stebila, D. (eds.) ACISP 2015. LNCS, vol. 9144, pp. 3\u201319. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19962-7_1"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11599548_15","volume-title":"Information Security and Cryptology","author":"P Wang","year":"2005","unstructured":"Wang, P., Feng, D., Wu, W.: HCTR: a variable-input-length enciphering mode. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 175\u2013188. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11599548_15"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-662-52993-5_26","volume-title":"Fast Software Encryption","author":"P Wang","year":"2016","unstructured":"Wang, P., Li, Y., Zhang, L., Zheng, K.: Related-key almost universal hash functions: definitions, constructions and applications. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 514\u2013532. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-52993-5_26"},{"issue":"3","key":"3_CR37","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","year":"1999","unstructured":"Wiener, M. (ed.): CRYPTO 1999. LNCS, vol. 1666. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48405-1"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-02937-5_2","volume-title":"Cryptology and Network Security","author":"B Zhu","year":"2013","unstructured":"Zhu, B., Tan, Y., Gong, G.: Revisiting MAC forgeries, weak keys and provable security of galois\/counter mode of operation. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol. 8257, pp. 20\u201338. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-02937-5_2"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89339-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T15:06:46Z","timestamp":1523027206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89339-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893389","9783319893396"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89339-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}