{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:15Z","timestamp":1748751075904,"version":"3.41.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319256443"},{"type":"electronic","value":"9783319256450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25645-0_21","type":"book-chapter","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T12:24:45Z","timestamp":1448281485000},"page":"316-330","source":"Crossref","is-referenced-by-count":8,"title":["Evolving Highly Nonlinear Balanced Boolean Functions with Improved Resistance to DPA Attacks"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra S.","family":"Chaudhari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"key":"21_CR1","unstructured":"Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press (1996)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/CBO9780511780448.011","volume":"134","author":"C Carlet","year":"2010","unstructured":"Carlet, C.: Boolean functions for cryptography and error correcting codes. Boolean Models and Methods in Mathematics, Computer Science, and Engineering 134, 257 (2010)","journal-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering"},{"issue":"12","key":"21_CR3","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1109\/TIFS.2013.2285522","volume":"8","author":"B Mazumdar","year":"2013","unstructured":"Mazumdar, B., Mukhopadhyay, D., Sengupta, I.: Constrained search for a class of good bijective-boxes with improved DPA resistivity. IEEE Transactions on Information Forensics and Security 8(12), 2154\u20132163 (2013)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1007\/978-3-319-10762-2_80","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Picek","year":"2014","unstructured":"Picek, S., Batina, L., Jakobovic, D.: Evolving DPA-resistant boolean functions. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 812\u2013821. Springer, Heidelberg (2014)"},{"key":"21_CR5","unstructured":"Burnett, L.D.: Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. Ph.D. thesis (2005)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-11145-7_5","volume-title":"Information and Communications Security","author":"C Cid","year":"2009","unstructured":"Cid, C., Kiyomoto, S., Kurihara, J.: The rakaposhi stream cipher. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol. 5927, pp. 32\u201346. Springer, Heidelberg (2009)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"WL Millan","year":"1998","unstructured":"Millan, W.L., Clark, A.J., 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)"},{"key":"21_CR8","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power analysis attacks: Revealing the secrets of smart cards, vol. 31. Springer Science & Business Media (2008)"},{"key":"21_CR9","first-page":"11","volume":"2013","author":"J McLaughlin","year":"2013","unstructured":"McLaughlin, J., Clark, J.A.: Evolving balanced boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. IACR Cryptology ePrint Archive 2013, 11 (2013)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45539-6_35","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P Sarkar","year":"2000","unstructured":"Sarkar, P., Maitra, S.: Construction of nonlinear boolean functions with important cryptographic properties. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 485\u2013506. Springer, Heidelberg (2000)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/BFb0054147","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"\u00c9 Filiol","year":"1998","unstructured":"Filiol, \u00c9., 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)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11502760_29","volume-title":"Fast Software Encryption","author":"E Prouff","year":"2005","unstructured":"Prouff, E.: DPA attacks and S-boxes. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 424\u2013441. Springer, Heidelberg (2005)"},{"key":"21_CR13","unstructured":"Braeken, A.: Cryptographic properties of Boolean functions and S-boxes. Ph.D. thesis (2006)"},{"key":"21_CR14","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesly (1989)"},{"issue":"6","key":"21_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Genetic algorithms: A survey. Computer 27(6), 17\u201326 (1994)","journal-title":"Computer"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Khanesar, M.A., Teshnehlab, M., Shoorehdeli, M.A.: A novel binary particle swarm optimization. In: Mediterranean Conference on Control & Automation, pp. 1\u20136. IEEE (2007)","DOI":"10.1109\/MED.2007.4433821"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5, pp. 4104\u20134108. IEEE (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"21_CR18","unstructured":"Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence, pp. 69\u201373. IEEE (1998)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121\u2013132. Springer, Heidelberg (2000)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Harding, S.L., Miller, J.F., Banzhaf, W.: Self-modifying cartesian genetic programming. In: Cartesian Genetic Programming, pp. 101\u2013124. Springer (2011)","DOI":"10.1007\/978-3-642-17310-3_4"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Miller, J.F.: Cartesian genetic programming. Natural Computing Series. Springer (2011)","DOI":"10.1007\/978-3-642-17310-3"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Andrews, P.S.: An investigation into mutation operators for particle swarm optimization. In: IEEE Congress on Evolutionary Computation. CEC 2006, pp. 1044\u20131051. IEEE (2006)","DOI":"10.1109\/CEC.2006.1688424"},{"key":"21_CR23","unstructured":"Angeline, P.J.: Using selection to improve particle swarm optimization. In: Proceedings of IEEE International Conference on Evolutionary Computation, vol. 89 (1998)"},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","volume":"8","author":"A Ratnaweera","year":"2004","unstructured":"Ratnaweera, A., Halgamuge, S., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8(3), 240\u2013255 (2004)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"21_CR25","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 2, pp. 1135\u20131142 (1999)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Marchiori, E., Batina, L.: Evolutionary methods for the construction of cryptographic boolean functions. In: Genetic Programming, pp. 192\u2013204. Springer (2015)","DOI":"10.1007\/978-3-319-16501-1_16"},{"issue":"2","key":"21_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"JF Miller","year":"2006","unstructured":"Miller, J.F., Smith, S.L.: Redundancy and computational efficiency in cartesian genetic programming. IEEE Transactions on Evolutionary Computation 10(2), 167\u2013174 (2006)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25645-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:42:25Z","timestamp":1748698945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25645-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319256443","9783319256450"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25645-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}