{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:18:52Z","timestamp":1761675532628},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424567"},{"type":"electronic","value":"9783540446477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_27","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"458-469","source":"Crossref","is-referenced-by-count":14,"title":["Nonlinear Vector Resilient Functions"],"prefix":"10.1007","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. Bennett","year":"1988","unstructured":"C. Bennett, G. Brassard, and J. Robert, \u201cPrivacy Amplification by Public Discassion,\u201d SIAM J. Computing, Vol. 17, pp. 210\u2013229, 1988.","journal-title":"SIAM J. Computing"},{"issue":"6","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C. Bennett","year":"1995","unstructured":"C. Bennett, G. Brassard, C. Cr\u2019epeau, and U. Maurer, \u201cGeneralized Privacy Amplification,\u201d IEEE Trans. on Information Theory, Vol. 41, No. 6, pp. 1915\u20131923, 1995.","journal-title":"IEEE Trans. on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"J. Bierbrauer, K. Gopalakrishnan, and D. Stinson, \u201cBounds on Resilient Functions and Orthogonal Arrays, \u201d Proc. of Crypto\u201994, pp. 247\u2013256, Springer-Verlag, 1994.","key":"27_CR3","DOI":"10.1007\/3-540-48658-5_24"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A. Brouwer","year":"1993","unstructured":"A. Brouwer and T. Verhoeff, \u201cAn Updated Table of Mimimum-Distance Bounds for Binary Linear Codes,\u201d IEEE Trans. on Infomation Theory, Vol. 39, No. 2, pp. 662\u2013677, 1993.","journal-title":"IEEE Trans. on Infomation Theory"},{"doi-asserted-by":"crossref","unstructured":"J. Cheon and S. Chee, \u201cElliptic Curves and Resilient Functions,\u201d Proc. of ICISC\u201900, pp. 64\u201372, 2000.","key":"27_CR5","DOI":"10.1007\/3-540-45247-8_6"},{"doi-asserted-by":"crossref","unstructured":"P. Camion, C. Carlet, P. Charpin, and N. Sendrier, \u201cOn Correlation Immune Functions,\u201d Proc. of Crypto\u201991, pp. 86\u2013100, Springer-Verlag, 1992.","key":"27_CR6","DOI":"10.1007\/3-540-46766-1_6"},{"doi-asserted-by":"crossref","unstructured":"S. Chee, S. Lee, D. Lee, and S. Sung, \u201cOn the Correlation Immune Functions and their Nonlinearity,\u201d Proc. of Asiacrypt\u201996, pp. 232\u2013243, Springer-Verlag, 1996.","key":"27_CR7","DOI":"10.1007\/BFb0034850"},{"key":"27_CR8","first-page":"396","volume":"26","author":"B. Chor","year":"1985","unstructured":"B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, \u201cThe Bit Extraction Problem or t-Resilient Functions,\u201d IEEE Symposium on Foundations of Computer Science, Vol. 26, pp. 396\u2013407, 1985.","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0166-218X(99)00150-X","volume":"99","author":"K. Friedl","year":"2000","unstructured":"K. Friedl and S.C. Tsai, \u201cTwo Results on the Bit Extraction Problem\u201d, Discrete Applied Mathematics, Vol 99, pp. 443\u2013454, 2000","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"J. Friedman, \u201cOn the Bit Extraction Problem,\u201d Proc. of 33rd IEEE Symposium on Foundations of Computer Science, pp. 314\u2013319, 1992.","key":"27_CR10","DOI":"10.1109\/SFCS.1992.267760"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02570836","volume":"209","author":"G. Geer van der","year":"1992","unstructured":"G. van der Geer and M. van der Vlugt, \u201cTrace Codes and Families of Algebraic Curves,\u201d Math. Z., Vol. 209, pp. 307\u2013315, Springer-Verlag, 1992.","journal-title":"Math. Z."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s001459900024","volume":"10","author":"A. Klapper","year":"1997","unstructured":"A. Klapper and M. Goresky, \u201cFeedback Shift Registers, Combiners with Memory, and 2-adic Span,\u201d Journal of Cryptology, Vol. 10, Springer-Verlag, pp. 111\u2013147, 1997.","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"J.H. van Lint, Intoroduction to Coding Theory, Springer-Verlag, 1992.","key":"27_CR13","DOI":"10.1007\/978-3-662-00174-5"},{"doi-asserted-by":"crossref","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, 1997.","key":"27_CR14","DOI":"10.1017\/CBO9780511525926"},{"doi-asserted-by":"crossref","unstructured":"K. Nyberg, \u201cS-Boxes and Round Functions with Controllable Linearity and Differential Uniformity,\u201d Proc. of the Second Fast Software Encryption, pp. 111\u2013130, Springer-Verlag, 1994.","key":"27_CR15","DOI":"10.1007\/3-540-60590-8_9"},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-46665-7_3","volume-title":"Proc. of IMA Conference on Cryptography and Coding","author":"E. Pasalic","year":"1999","unstructured":"E. Pasalic and T. Johansson, \u201cFurther Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions,\u201d Proc. of IMA Conference on Cryptography and Coding, pp. 35\u201344, LNCS 1746, Springer-Verlag, 1999."},{"doi-asserted-by":"crossref","unstructured":"P. Sarkar and S. Maitra, \u201cNonlinearity Bounds and Constructions of Resilient Boolean Functions,\u201d Proc. of Crypto\u201900, pp. 515\u2013532, Springer-Verlag, 2000.","key":"27_CR17","DOI":"10.1007\/3-540-44598-6_32"},{"doi-asserted-by":"crossref","unstructured":"J. Seberry, X. Zhang and Y. Zheng, \u201cOn Constructions and Nonlinearity of Correlation Immune Boolean Functions,\u201d Eurocrypt\u201993, pp. 181\u2013199, Springer-Verlag, 1993.","key":"27_CR18","DOI":"10.1007\/3-540-48285-7_16"},{"issue":"5","key":"27_CR19","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"IT-30","author":"T. Siegenthaler","year":"1984","unstructured":"T. Siegenthaler, \u201cCorrelation-Immunity of Nonlinear Combining Functions for Cryptographic Applications,\u201d IEEE Transactions on Information Theory, IT-30(5), pp. 776\u2013780, 1984.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"27_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"D. Stinson","year":"1995","unstructured":"D. Stinson and J. Massey, \u201cAn Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions,\u201d Journal of Cryptology, Vol 8, No. 3, pp. 167\u2013173, Springer-Verlag, 1995.","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"Y. Tarannikov, \u201cOn Resilient Boolean Functions with Maximum Possible Nonlinearity,\u201d Proc. of Indocrypt\u201900, pp. 19\u201330, Springer-Verlag, 2000.","key":"27_CR21","DOI":"10.1007\/3-540-44495-5_3"},{"doi-asserted-by":"crossref","unstructured":"M. Zhang and A. Chan, \u201cMaximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers,\u201d Proc. of Crypto2000, pp. 501\u2013514, Springer-Verlag, 2000.","key":"27_CR22","DOI":"10.1007\/3-540-44598-6_31"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1109\/18.623184","volume":"43","author":"X. Zhang","year":"1997","unstructured":"X. Zhang and Y. Zheng, \u201cCryptographically Resilient Functions,\u201d IEEE Trans. Inform. Theory, Vol 43, No 5, pp. 1740\u20131747, 1997.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:21:51Z","timestamp":1556950911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}