{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:10Z","timestamp":1725514990505},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540794080"},{"type":"electronic","value":"9783540794097"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79409-7_26","type":"book-chapter","created":{"date-parts":[[2008,6,18]],"date-time":"2008-06-18T07:09:47Z","timestamp":1213772987000},"page":"381-391","source":"Crossref","is-referenced-by-count":0,"title":["A Deterministic Optimization Approach for Generating Highly Nonlinear Balanced Boolean Functions in Cryptography"],"prefix":"10.1007","author":[{"given":"Le Hoai","family":"Minh","sequence":"first","affiliation":[]},{"given":"Le Thi Hoai","family":"An","sequence":"additional","affiliation":[]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"26_CR1_1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"Le Thi Hoai An","year":"1997","unstructured":"Le Thi Hoai An and Pham Dinh Tao, Solving a class of linearly constrained indefinite quadratic problems by DC algorithms, Journal of Global Optimization, Vol 11, No 3, pp 253-285, 1997.","journal-title":"Journal of Global Optimization"},{"key":"26_CR2_1","doi-asserted-by":"crossref","unstructured":"Le Thi Hoai An and Pham Dinh Tao, A continuous Approach for Globally Solving Linearly Constrained Quadratic Zero - One Programming Problems, Optimization 2001, Vol 50, pp. 93-120.","DOI":"10.1080\/02331930108844555"},{"key":"26_CR3_1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"Le Thi Hoai An","year":"2005","unstructured":"Le Thi Hoai An and Pham Dinh Tao, The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems, Annals of Operations Research 2005, Vol 133, pp. 23-46.","journal-title":"Annals of Operations Research"},{"key":"26_CR4_1","unstructured":"Le Thi Hoai An, Pham Dinh Tao, Huynh Van Ngai, Exact penalty techniques in DC programming. SIAM Conference on Optimzation, 2005."},{"key":"26_CR5_1","doi-asserted-by":"crossref","unstructured":"P. Charpin, A. Canteau, C. Carlet and C. Fotaine, Propagation characteristic and correlation-immunity of hight nonlinenar Boolean function. In Lecture Note in Computer Science, Springer Verlag 2000, N 1807, pp. 507-522.","DOI":"10.1007\/3-540-45539-6_36"},{"key":"26_CR6_1","unstructured":"A. J. Clark, Optimisation Heuristics for Cryptology, Ph D Thesis, 1998."},{"key":"26_CR7_1","unstructured":"W. Millan, A. Clark, and E. Dawson, Smart Hill Climbing Finds Better Boolean Functions, In Workshop on Selected Areas in Cryptology 1997, Workshop Record, pages 50-63, 1997."},{"key":"26_CR8_1","doi-asserted-by":"crossref","unstructured":"J. A. Clark, J. L. Jacob, S. Stepney, The design of S-boxes by simulated annealing, CEC 2004: International Conference on Evolutionary Computation, Portland OR, USA, June 2004, pp 1533-1537. IEEE 2004.","DOI":"10.1109\/CEC.2004.1331078"},{"issue":"1","key":"26_CR9_1","first-page":"289","volume":"22","author":"Le Thi Hoai An","year":"1997","unstructured":"Pham Dinh Tao and Le Thi Hoai An, Convex analysis approach to d.c. programming: Theory, Algorithms and Applications, Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday, Vol.22, N. 1 (1997), pp. 289-355.","journal-title":"Acta Mathematica Vietnamica"},{"key":"26_CR10_1","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"Le Thi Hoai An","year":"1998","unstructured":"Pham Dinh Tao and Le Thi Hoai An, DC optimization algorithms for solving the trust region subproblem, SIAM J. Optimization, Vol. 8, pp. 476-505 (1998).","journal-title":"SIAM J. Optimization"},{"key":"26_CR11_1","doi-asserted-by":"crossref","unstructured":"P. Sarkar and S. Maitra, Construction of nonlinear Boolean functions with important cryptographic properties. In Lecture Note in Computer Science, Springer Verlag 2000, N 1807,pp. 485-506.","DOI":"10.1007\/3-540-45539-6_35"},{"key":"26_CR12_1","doi-asserted-by":"crossref","unstructured":"J. Seberry, X. M. Zhang, and Y. Zheng, Nonlinearly balanced Boolean functions and their propagation characteristics. In Advances in Cryptology - CRYPT0\u201993, pp. 49-60, Springer Verlag 1994.","DOI":"10.1007\/3-540-48329-2_5"},{"key":"26_CR13_1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.endm.2005.05.071","volume":"20","author":"S Weber","year":"2005","unstructured":"S. Weber, T. Sch\u00fcle, C. Schn\u00f6rr, Prior Learning and Convex-Concave Regularization of Binary Tomography, Electr. Notes in Discr. Math., 20:313-327, 2005. December 2003.","journal-title":"Electr. Notes in Discr. Math."}],"container-title":["Modeling, Simulation and Optimization of Complex Processes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79409-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:00Z","timestamp":1619522460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79409-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540794080","9783540794097"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79409-7_26","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}