{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:20Z","timestamp":1725603440204},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_7","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"54-68","source":"Crossref","is-referenced-by-count":5,"title":["The Design of Cryptographic S-Boxes Using CSPs"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Ramamoorthy","sequence":"first","affiliation":[]},{"given":"Marius C.","family":"Silaghi","sequence":"additional","affiliation":[]},{"given":"Toshihiro","family":"Matsui","sequence":"additional","affiliation":[]},{"given":"Katsutoshi","family":"Hirayama","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1007\/0-387-34805-0_56","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.M. Adams","year":"1990","unstructured":"Adams, C.M., Tavares, S.E.: Good S-boxes are easy to find. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 612\u2013615. Springer, Heidelberg (1990)"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1109\/18.57222","volume":"36","author":"C. Adams","year":"1990","unstructured":"Adams, C., Tavares, S.: Generating and counting binary bent sequences. IEEE Transactions on Information Theory\u00a036(5), 1170\u20131173 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR3","first-page":"309","volume-title":"IJCAI","author":"C. Bessi\u00e8re","year":"2001","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Refining the basic constraint propagation algorithm. In: Nebel, B. (ed.) IJCAI, pp. 309\u2013315. Morgan Kaufmann, San Francisco (2001)"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9314-6","volume-title":"Differential cryptanalysis of the data encryption standard","author":"E. Biham","year":"1993","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of the data encryption standard. Springer, Heidelberg (1993)"},{"key":"7_CR5","first-page":"2173","volume":"3","author":"J. Clark","year":"2003","unstructured":"Clark, J., Jacob, J., Maitra, S., Stanica, P.: Almost boolean functions: the design of boolean functions by spectral inversion. Evolutionary Computation\u00a03, 2173\u20132180 (2003)","journal-title":"Evolutionary Computation"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1147\/rd.383.0243","volume":"38","author":"D. Coppersmith","year":"1994","unstructured":"Coppersmith, D.: The data encryption standard (des) and its strength against attacks. IBM J. Res. Dev.\u00a038(3), 243\u2013250 (1994)","journal-title":"IBM J. Res. Dev."},{"key":"7_CR7","unstructured":"Daemen, J., Rijmen, V.: Aes proposal: Rijndael (September 1999), \n                    \n                      http:\/\/csrc.nist.gov\/archive\/aes\/rijndael\/Rijndael-ammended.pdf"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H. Feistel","year":"1973","unstructured":"Feistel, H.: Cryptography and computer privacy. Scientific American\u00a0228, 15\u201323 (1973)","journal-title":"Scientific American"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ipl.2005.02.014","volume":"95","author":"K.C. Gupta","year":"2005","unstructured":"Gupta, K.C., Sarkar, P.: Construction of high degree resilient S-boxes with improved nonlinearity. Inf. Process. Lett.\u00a095(3), 413\u2013417 (2005)","journal-title":"Inf. Process. Lett."},{"key":"7_CR10","unstructured":"Hoeve, W.V.: The alldifferent constraint: A survey. In: Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints (2001)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-46877-3_35","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"X. Lai","year":"1991","unstructured":"Lai, X., Massey, J.L.: A proposal for a new block encryption standard. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 389\u2013404. Springer, Heidelberg (1991)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Laskari, E.C., Meletiou, G.C., Vrahatis, M.N.: Utilizing evolutionary computation methods for the design of S-boxes. In: Proceedings of the International Conference on Computational Intelligence and Security 2006 (CIS 2006), China (2006) (in press)","DOI":"10.1109\/ICCIAS.2006.295267"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for des cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 386\u2013397. Springer, Heidelberg (1994)"},{"key":"7_CR14","unstructured":"Mister, S., Adams, C.: Practical S-Box design (1996)"},{"key":"7_CR15","unstructured":"NIST: Data encryption standard (DES). Federal Information Processing Standard (FIPS) 46-2 (January 1988)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02318546","volume":"7","author":"L. O\u2019Connor","year":"1994","unstructured":"O\u2019Connor, L.: An analysis of a class of algorithms for s-box construction. J. Cryptology\u00a07(3), 133\u2013151 (1994)","journal-title":"J. Cryptology"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","first-page":"134","volume-title":"Fast Software Encryption","author":"L. O\u2019Connor","year":"1995","unstructured":"O\u2019Connor, L.: Properties of linear approximation tables. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 134\u2013136. Springer, Heidelberg (1995)"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1049\/ip-e.1988.0044","volume":"135","author":"J. Pieprzyk","year":"1988","unstructured":"Pieprzyk, J., Finkelstein, G.: Towards effective nonlinear cryptosystem design. IEE Proceedings Computers and Digital Techniques\u00a0135(6), 325\u2013335 (1988)","journal-title":"IEE Proceedings Computers and Digital Techniques"},{"key":"7_CR19","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: AAAI 1998, pp. 359\u2013366 (1998)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-58601-6_86","volume-title":"Principles and Practice of Constraint Programming","author":"D. Sabin","year":"1994","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: PPCP 1994. LNCS, vol.\u00a0874, pp. 10\u201320. Springer, Heidelberg (1994)"},{"key":"7_CR21","unstructured":"Schneier, B.: Applied cryptography \u2014 protocols, algorithms, and source code in c. In: Textbook, ch. 12, pp. 265\u2013301 (2002)"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"7_CR23","unstructured":"Stallings, W.: Cryptography and network security - principles and practices. In: Textbook, ch. 3, pp. 86\u201390 (2003), \n                    \n                      http:\/\/www.prenhall.com\/stallings"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:23:20Z","timestamp":1554135800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}