{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:56:14Z","timestamp":1725476174337},"publisher-location":"Boston, MA","reference-count":23,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387362328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-36503-9_12","type":"book-chapter","created":{"date-parts":[[2007,1,10]],"date-time":"2007-01-10T06:47:50Z","timestamp":1168411670000},"page":"121-135","source":"Crossref","is-referenced-by-count":1,"title":["Random Generation of S-Boxes for Block Ciphers"],"prefix":"10.1007","author":[{"given":"Anna","family":"Grocholewska-Czury\u0142o","sequence":"first","affiliation":[]},{"given":"Janusz","family":"Stok\u0142osa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1109\/18.57222","volume":"IT-36","author":"C.M. Adams","year":"1990","unstructured":"Adams, C.M., Tavares, S.E.: Generating and Counting Binary Bent Sequences. IEEE Transactions on Information Theory, IT-36 (1990) 1170\u20131173","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: Searching for cost functions. In: International Conference on Evolutionary Computation, IEEE, Portland, OR, USA (2004) 1517\u20131524","key":"12_CR2","DOI":"10.1109\/CEC.2004.1331076"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-46416-6_30","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 91","author":"M. Dawson","year":"1991","unstructured":"Dawson, M., Tavares, S. E,: An Expanded Set of S-Box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks. In: Davies, D.W. (ed.), Advances in Cryptology \u2014 Eurocrypt\u2019 91. Lecture Notes in Computer Science, Vol. 547. Springer-Verlag, Berlin (1991) 352\u2013367"},{"unstructured":"Dillon, J.F.: A Survey of Bent Functions. NSA Technical Journal, Special Issue (1972) 191\u2013215","key":"12_CR4"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/0-387-34799-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"R. Forr\u00e9","year":"1990","unstructured":"Forr\u00e9, R.: The strict avalanche criterion: spectral properties of Boolean functions with high nonlinearity. In: Goldwasser, S. (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 88. Lecture Notes in Computer Science, Vol. 403. Springer-Verlag, Berlin (1990) 450\u2013468"},{"doi-asserted-by":"crossref","unstructured":"Grocholewska-Czury\u0142o, A., Stok\u0142osa, J.: Generating Bent Functions. In: So\u0142dek, J., Peja\u015b, J. (eds.): Advanced Computer Systems, Kluwer, Boston (2002) 361\u2013370","key":"12_CR6","DOI":"10.1007\/978-1-4419-8530-9_29"},{"key":"12_CR7","first-page":"1025","volume":"IT-43","author":"X.D. Hou","year":"1997","unstructured":"Hou, X.D.: On the norm and covering radius of first order Reed-Muller codes. IEEE Transactions of Information Theory IT-43 (1997) 1025\u20131027","journal-title":"IEEE Transactions of Information Theory"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1109\/TC.1979.1675242","volume":"C-28","author":"J.B. Kam","year":"1979","unstructured":"Kam, J.B., Davida, G.: Structured Design of Substitution-Permutation Encryption Networks. IEEE Transactions on Computers C-28(1979) 747\u2013753","journal-title":"IEEE Transactions on Computers"},{"unstructured":"Kurosawa, K., Satoh, T.: Generalization of higher order SAC to vector output Boolean functions. IEICE Transactions, E90 1 (1998)","key":"12_CR9"},{"unstructured":"Maiorana, J.A.: A Class of Bent Functions., R41 Technical Paper (1971)","key":"12_CR10"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-540-25937-4_10","volume-title":"Fast Software Encryption","author":"S. Maity","year":"2004","unstructured":"Maity, S., Maitra, S.: Minimum distance between bent and l-resilient Boolean functions. In: Roy, B., Meier, W. (eds.): Fast Software Encryption. Lecture Notes in Computer Science, Vol. 3017. Springer-Verlag, Berlin (2004) 143\u2013160"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-46885-4_53","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 89","author":"W. Meier","year":"1990","unstructured":"Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. In: Brassard, G. (ed.): Advances in Cryptology \u2014 EUROCRYPT\u2019 89. Lecture Notes in Computer Science, Vol. 434. Springer-Verlag, Berlin (1990) 549\u2013562"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology EUROCRYPT\u2019 98","author":"W. Millan","year":"1998","unstructured":"Millan, W., Clark, A., Dawson, E.: Heuristic design of cryptographically strong balanced Boolean functions. In: Nyberg, K. (ed.): Advances in Cryptology EUROCRYPT\u2019 98. Lecture Notes in Computer Science, Vol. 1403. Springer-Verlag, Berlin (1998) 489\u2013499"},{"unstructured":"Mister, S., Adams, C: Practical S-Box Design. In: Workshop on Selected Areas in Cryptography (SAC\u2019 96) Workshop Record. Queens University (1996) 61\u201376","key":"12_CR14"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-46877-3_13","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 90","author":"K. Nyberg","year":"1991","unstructured":"Nyberg, K.: Constructions of bent functions and difference sets. In: Damg\u00e5rd, I.B. (ed.): Advances in Cryptology \u2014 EUROCRYPT\u2019 90. Lecture Notes in Computer Science, Vol. 473. Springer-Verlag, Berlin (1991) 151\u2013160"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances of Cryptology \u2014 EUROCRYPT\u2019 91","author":"K. Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-boxes, Davies. In: D. W. (ed.): Advances of Cryptology \u2014 EUROCRYPT\u2019 91. Lecture Notes in Computer Science, Vol. 547. Springer-Verlag, Berlin (1991) 378\u2013386"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02318546","volume":"3","author":"L.J. O\u2019Connor","year":"1994","unstructured":"O\u2019Connor, L.J.: An analysis of a class of algorithms for S-box construction. Journal of Cryptology 3(1994) 133\u2013152","journal-title":"Journal of Cryptology"},{"key":"12_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07324-7","volume-title":"Fundamentals of Computer Security","author":"J. Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer-Verlag, Berlin (2003)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/3-540-46877-3_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 90","author":"B. Preneel","year":"1991","unstructured":"Preneel, B, Van Leekwijck, W, Van Linden, L, Govaerts, R, Vandewalle, J.: Propagation characteristics of Boolean functions. In: Damg\u00e5rd, I.B. (ed.): Advances in Cryptology \u2014 EUROCRYPT\u2019 90. Lecture Notes in Computer Science, Vol. 473, Springer-Verlag, Berlin (1991) 161\u2013173"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O.S. Rothaus","year":"1976","unstructured":"Rothaus, O.S.: On bent functions. Journal of Combinatorial Theory, 20 (1976) 300\u2013305","journal-title":"Journal of Combinatorial Theory"},{"doi-asserted-by":"crossref","unstructured":"Seberry, J., Zhang, X.M., Zheng, Y.: Systematic generation of cryptographically robust S-boxes. In: Proceedings of the 1st ACM Conference on Computer and Communication Security (1993)","key":"12_CR21","DOI":"10.1145\/168588.168610"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-39799-X_41","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 85","author":"A.F. Webster","year":"1986","unstructured":"Webster, A.F., Tavares, S.E.: On the Design of S-Boxes. In: Williams, H.C. (ed.): Advances in Cryptology \u2014 CRYPTO\u2019 85. Lecture Notes in Computer Science, Vol. 218. Springer-Verlag, Berlin (1986) 523\u2013534"},{"key":"12_CR23","first-page":"112","volume":"136","author":"R. Yarlagadda","year":"1989","unstructured":"Yarlagadda, R., Hershey, J.E.: Analysis and synthesis of bent sequences. In: Proceedings of the IEE, vol. 136 (1989) 112\u2013123","journal-title":"Proceedings of the IEE"}],"container-title":["Biometrics, Computer Security Systems and Artificial Intelligence Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-36503-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:56:36Z","timestamp":1619574996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-36503-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387362328"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-36503-9_12","relation":{},"subject":[]}}