{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:14:30Z","timestamp":1725880470292},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319531762"},{"type":"electronic","value":"9783319531779"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53177-9_16","type":"book-chapter","created":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T04:35:07Z","timestamp":1486528507000},"page":"304-316","source":"Crossref","is-referenced-by-count":0,"title":["On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks"],"prefix":"10.1007","author":[{"given":"Yusong","family":"Du","sequence":"first","affiliation":[]},{"given":"Baodian","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,9]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-25937-4_5","volume-title":"Fast Software Encryption","author":"F Armknecht","year":"2004","unstructured":"Armknecht, F.: Improving fast algebraic attacks. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 65\u201382. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-25937-4_5"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11761679_10","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"F Armknecht","year":"2006","unstructured":"Armknecht, F., Carlet, C., Gaborit, P., K\u00fcnzli, S., Meier, W., Ruatta, O.: Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 147\u2013164. Springer, Heidelberg (2006). doi: 10.1007\/11761679_10"},{"issue":"3","key":"16_CR3","first-page":"81","volume":"44","author":"VV Baev","year":"2008","unstructured":"Baev, V.V.: Some lower bounds on the algebraic immunity of functions given by their trace forms. Problemy Peredachi Informatsii 44(3), 81\u2013104 (2008)","journal-title":"Problemy Peredachi Informatsii"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-89255-7_26","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"C Carlet","year":"2008","unstructured":"Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425\u2013440. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89255-7_26"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-45146-4_11","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176\u2013194. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45146-4_11"},{"key":"16_CR6","unstructured":"Dalai, D.K.: Computing the rank of incidence matrix and algebraic immunity of boolean functions. IACR Cryptology ePrint Archive 2013, 273 (2013)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-31912-9_18","volume-title":"Information Security and Cryptology - ICISC 2011","author":"Y Du","year":"2012","unstructured":"Du, Y., Zhang, F., Liu, M.: On the resistance of boolean functions against fast algebraic attacks. In: Kim, H. (ed.) ICISC 2011. LNCS, vol. 7259, pp. 261\u2013274. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31912-9_18"},{"issue":"1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/s11424-016-5208-z","volume":"29","author":"X Feng","year":"2016","unstructured":"Feng, X., Gong, G.: On algebraic immunity of trace inverse functions on finite fields of characteristic two. J. Syst. Sci. Complexity 29(1), 272\u2013288 (2016)","journal-title":"J. Syst. Sci. Complexity"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Liu, M., Lin, D.: Almost perfect algebraic immune functions with good nonlinearity. In: 2014 IEEE International Symposium on Information Theory, pp. 1837\u20131841. IEEE (2014)","DOI":"10.1109\/ISIT.2014.6875151"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-34961-4_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Liu","year":"2012","unstructured":"Liu, M., Zhang, Y., Lin, D.: Perfect algebraic immune functions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 172\u2013189. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34961-4_12"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Nawaz, Y., Gong, G., Gupta, K.C.: Upper bounds on algebraic immunity of boolean power functions. In: International Workshop on Fast Software Encryption, pp. 375\u2013389. Springer, Heidelberg (2006)","DOI":"10.1007\/11799313_24"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-00730-9_25","volume-title":"Information Security and Cryptology \u2013 ICISC 2008","author":"E Pasalic","year":"2009","unstructured":"Pasalic, E.: Almost fully optimized infinite classes of boolean functions resistant to (fast) algebraic cryptanalysis. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 399\u2013414. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00730-9_25"},{"issue":"8","key":"16_CR13","doi-asserted-by":"crossref","first-page":"4014","DOI":"10.1109\/TIT.2010.2050801","volume":"56","author":"P Rizomiliotis","year":"2010","unstructured":"Rizomiliotis, P.: On the resistance of boolean functions against algebraic attacks using univariate polynomial representation. IEEE Trans. Inf. Theor. 56(8), 4014\u20134024 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12095-012-0063-9","volume":"5","author":"W Wang","year":"2013","unstructured":"Wang, W., Liu, M., Zhang, Y.: Comments on a design of boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation. Crypt. Commun. 5(1), 1\u20136 (2013)","journal-title":"Crypt. Commun."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53177-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:02:56Z","timestamp":1498384976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53177-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319531762","9783319531779"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53177-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}