{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:01:33Z","timestamp":1648710093268},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11424-019-7263-8","type":"journal-article","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T13:29:07Z","timestamp":1571232547000},"page":"1460-1472","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Rotation Symmetric S-boxes"],"prefix":"10.1007","volume":"32","author":[{"given":"Guangpu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenfen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,16]]},"reference":[{"key":"7263_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/CBO9780511780448.011","volume-title":"Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering","author":"C Carlet","year":"2010","unstructured":"Carlet C, Boolean functions for cryptography and error correcting codes, Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cambridge University Press (Peter Hammer and Yves Crama editors), 2010, 257\u2013397."},{"key":"7263_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.jcta.2014.05.008","volume":"127","author":"C Carlet","year":"2014","unstructured":"Carlet C, Gao G, and Liu W, A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions, Journal of Combinatorial Theory, Series A, 2014, 127: 161\u2013175.","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"7","key":"7263_CR3","doi-asserted-by":"publisher","first-page":"4908","DOI":"10.1109\/TIT.2012.2193377","volume":"58","author":"G Gao","year":"2012","unstructured":"Gao G, Zhang X, Liu W, et al., Constructions of quadratic and cubic rotation symmetric bent functions, IEEE Transactions on Information Theory, 2012, 58(7): 4908\u20134913.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"7263_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1049\/iet-ifs.2013.0241","volume":"8","author":"G Gao","year":"2014","unstructured":"Gao G, Cusick T, and Liu W, Families of rotation symmetric functions with useful cryptographic properties, IET Information Security, 2014, 8(6): 297\u2013302.","journal-title":"IET Information Security"},{"key":"7263_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ins.2012.02.030","volume":"201","author":"S Kavut","year":"2012","unstructured":"Kavut S, Results on rotation-symmetric S-boxes, Information Sciences, 2012, 201: 93\u2013113.","journal-title":"Information Sciences"},{"issue":"1","key":"7263_CR6","first-page":"20","volume":"5","author":"J Pieprzyk","year":"1999","unstructured":"Pieprzyk J and Qu C, Fast Hashing and rotation symmetric functions, Journal of Universal Computer Science, 1999, 5(1): 20\u201331.","journal-title":"Journal of Universal Computer Science"},{"key":"7263_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2007.09.012","volume":"106","author":"V Rijmen","year":"2008","unstructured":"Rijmen V, Barreto P, and Filho D, Rotation symmetry in algebraically generated cryptographic substitution tables, Information Processing Letters, 2008, 106: 246\u2013250.","journal-title":"Information Processing Letters"},{"issue":"1","key":"7263_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TC.2016.2569410","volume":"66","author":"B Mazumdar","year":"2017","unstructured":"Mazumdar B and Mukhopadhayay D, Construction of rotation symmetric S-boxes with high nonlinearity and improved DPA resistivity, IEEE Trans. on Computers, 2017, 66(1): 59\u201372.","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"7263_CR9","doi-asserted-by":"publisher","first-page":"7970","DOI":"10.1109\/TIT.2014.2360880","volume":"60","author":"W Zhang","year":"2014","unstructured":"Zhang W and Pasalic E, Highly nonlinear balanced S-boxes with good differential properties, IEEE Transactions on Information Theory, 2014, 60(12): 7970\u20137979.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7263_CR10","volume-title":"Submission to NIST (Round 3)","author":"G Bertoni","year":"2011","unstructured":"Bertoni G, Daemen J, Peeters M, et al., The Keccak reference, Submission to NIST (Round 3), January, 2011."},{"key":"7263_CR11","doi-asserted-by":"crossref","unstructured":"Millan W, Clark A, and Dawson E, An effective genetic algorithm for finding highly nonlinear Boolean functions, The First International Conference on Information and Communications Security LNCS, Springer-Verlag, 1997, 1334: 149\u2013158.","DOI":"10.1007\/BFb0028471"},{"key":"7263_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume":"1403","author":"W Millan","year":"1998","unstructured":"Millan W, Clark A, and Dawson E, Heuristic design of cryptographically strong balanced Boolean functions, Advances in Cryptology \u2014 EUROCRYPT\u201998, LNCS, Springer-Verlag, 1998, 1403: 489\u2013499.","journal-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998, LNCS"},{"key":"7263_CR13","first-page":"1","volume":"1587","author":"W Millan","year":"1999","unstructured":"Millan W, Clark A, and Dawson E, Boolean function design using hill climbing methods, 4th Australasian Conference on Information, Security and Privacy, LNCS, Springer-Verlag, April, 1999, 1587: 1\u201311.","journal-title":"4th Australasian Conference on Information, Security and Privacy, LNCS"},{"issue":"5","key":"7263_CR14","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1109\/TIT.2006.872862","volume":"52","author":"Z Saber","year":"2006","unstructured":"Saber Z, Uddin M F, and Youssef A, On the existence of (9, 3, 5, 240) resilient functions, IEEE Transactions on Information Theory, 2006, 52(5): 2269\u20132270.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"7263_CR15","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TIT.2007.894696","volume":"53","author":"S Kavut","year":"2007","unstructured":"Kavut S, Maitra S, and Y\u00fccel M D, Search for Boolean functions with excellent profiles in the rotation symmetric class, IEEE Trans. Inf. Theory, 2007, 53(5): 1743\u20131751.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7263_CR16","first-page":"1533","volume-title":"Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC2004)","author":"J Clark","year":"2004","unstructured":"Clark J, Jacob J, and Stepney S, The design of S-boxes by simulated annealing, Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC2004), 2004, 1533\u20131537."},{"key":"7263_CR17","volume-title":"Computer Science","author":"J McLaughlin","year":"2013","unstructured":"McLaughlin J and Clark J, Using evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity, Computer Science, arXiv: 1301.6972, 2013."},{"key":"7263_CR18","first-page":"71","volume":"5","author":"O Kazymyrov","year":"2014","unstructured":"Kazymyrov O, Kazymyrova V, and Oliynykov R, A method for generation of high-nonlinear Sboxes based on gradient descent, Mathematical Aspects of Cryptography, Steklov Mathematical Institute, 2014, 5: 71\u201378.","journal-title":"Mathematical Aspects of Cryptography, Steklov Mathematical Institute"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7263-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-7263-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-7263-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:14:09Z","timestamp":1602717249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-7263-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["7263"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-7263-8","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]},"assertion":[{"value":"8 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}