{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:40:25Z","timestamp":1742989225338,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811033216"},{"type":"electronic","value":"9789811033223"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3322-3_11","type":"book-chapter","created":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T05:51:19Z","timestamp":1487829079000},"page":"122-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Introducing Biasedness in NSGA-II to Construct Boolean Function Having Best Trade-Off Among Its Properties"],"prefix":"10.1007","author":[{"given":"Rajni","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupama","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,24]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aguirre, H., Okazaki, H., Fuwa, Y.: An evolutionary multiobjective approach to design highly non-linear boolean functions. In: GECCO 2007, pp. 749\u2013756 (2007)","DOI":"10.1145\/1276958.1277112"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-46766-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"P Camion","year":"1992","unstructured":"Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 86\u2013100. Springer, Heidelberg (1992). doi:\n                  10.1007\/3-540-46766-1_6"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36231-2_20","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2002","author":"JA Clark","year":"2002","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S., Maitra, S., Millan, W.: Evolving Boolean functions satisfying multiple criteria. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 246\u2013259. Springer, Heidelberg (2002). doi:\n                  10.1007\/3-540-36231-2_20"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18965-4_10","volume-title":"Advances in Evolutionary Computing","author":"K Deb","year":"2003","unstructured":"Deb, K.: Multi-objective evolutionary algorithms: introducing bias among pareto-optimal solutions. In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computing, pp. 263\u2013292. Springer, New York (2003)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/BFb0054147","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"E Filiol","year":"1998","unstructured":"Filiol, E., Fontaine, C.: Highly nonlinear balanced Boolean functions with a good correlation-immunity. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 475\u2013488. Springer, Heidelberg (1998). doi:\n                  10.1007\/BFb0054147"},{"key":"11_CR7","series-title":"Advances in Intelligent and Soft Computing","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-81-322-0487-9_45","volume-title":"Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011)","author":"R Goyal","year":"2011","unstructured":"Goyal, R., Yadav, S.P.: Design of Boolean functions satisfying multiple criteria by NSGA-II. In: Deep, K., Nagar, A., Pant, M., Bansal, J.C. (eds.) SocProS 2011. AISC, vol. 130, pp. 461\u2013468. Springer, Heidelberg (2011). doi:\n                  10.1007\/978-81-322-0487-9_45"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-60590-8_5","volume-title":"Fast Software Encryption","author":"H Dobbertin","year":"1995","unstructured":"Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61\u201374. Springer, Heidelberg (1995). doi:\n                  10.1007\/3-540-60590-8_5"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/3-540-69053-0_30","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"K Kurosawa","year":"1997","unstructured":"Kurosawa, K., Satoh, T.: Design of SAC\/PC (l) of order k Boolean functions and three other cryptographic criteria. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 434\u2013449. Springer, Heidelberg (1997). doi:\n                  10.1007\/3-540-69053-0_30"},{"issue":"7","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1825","DOI":"10.1109\/TIT.2002.1013128","volume":"48","author":"S Maitra","year":"2002","unstructured":"Maitra, S., Pasalic, E.: Further constructions of resilient boolean functions with very high nonlinearity. IEEE Trans. Inf. Theory 48(7), 1825\u20131834 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"W Millan","year":"1998","unstructured":"Millan, W., Clark, A., Dawson, E.: Heuristic design of cryptographically strong balanced Boolean functions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 489\u2013499. Springer, Heidelberg (1998). doi:\n                  10.1007\/BFb0054148"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0034850","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 1996","author":"S Chee","year":"1996","unstructured":"Chee, S., Lee, S., Lee, D., Sung, S.H.: On the correlation immune functions and their nonlinearity. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 232\u2013243. Springer, Heidelberg (1996). doi:\n                  10.1007\/BFb0034850"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-44598-6_32","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"P Sarkar","year":"2000","unstructured":"Sarkar, P., Maitra, S.: Nonlinearity bounds and constructions of resilient boolean functions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 515\u2013532. Springer, Heidelberg (2000). doi:\n                  10.1007\/3-540-44598-6_32"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10623-013-9801-z","volume":"72","author":"S Su","year":"2014","unstructured":"Su, S., Tang, X., Zeng, X.: A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the ReedMuller code. Des. Codes Crypt. 72(3), 653\u2013673 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"14\u201316","key":"11_CR15","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.ipl.2013.04.017","volume":"113","author":"Q Wang","year":"2013","unstructured":"Wang, Q., Tan, C.H.: A new method to construct Boolean functions with good cryptographic properties. Inf. Process. Lett. 113(14\u201316), 567\u2013571 (2013). Elsevier","journal-title":"Inf. Process. Lett."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Sixth International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3322-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T14:09:34Z","timestamp":1558447774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3322-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811033216","9789811033223"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3322-3_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}