乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:06Z","timestamp":1740148926020,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T00:00:00Z","timestamp":1526860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s12095-018-0311-8","type":"journal-article","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T14:37:39Z","timestamp":1526913459000},"page":"41-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Cellular automata based S-boxes"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3089-6517","authenticated-orcid":false,"given":"Luca","family":"Mariot","sequence":"first","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Leporati","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,21]]},"reference":[{"key":"311_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46706-0_1","volume-title":"Fast Software Encryption","author":"Daniel Augot","year":"2015","unstructured":"Augot, D., Finiasz, M.: Direct construction of recursive MDS diffusion layers using shortened BCH codes. In: Fast Software Encryption\u201421st International Workshop, FSE 2014, London, UK, March 3\u20135, 2014. Revised Selected Papers, pp. 3\u201317 (2014)"},{"volume-title":"Evolutionary Computation 1: Basic Algorithms and Operators","year":"2000","key":"311_CR2","unstructured":"B\u00e4ck, T., Fogel, D., Michalewicz, Z (eds.): Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)"},{"key":"311_CR3","first-page":"369","volume":"2006","author":"G Bertoni","year":"2006","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: Radiogat\u00fan, a belt-and-mill hash function. IACR Cryptology ePrint Archive 2006, 369 (2006)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"311_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference. \nhttp:\/\/keccak.noekeon.org\/\n\n (2011)"},{"key":"311_CR5","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J., Seurin, Y., Vikkelsoe, C.: PRESENT: an ultra-lightweight block cipher. In: Proceedings of the 9th International Workshop on Cryptographic Hardware and Embedded Systems, CHES \u201907, pp. 450\u2013466. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"311_CR6","doi-asserted-by":"crossref","unstructured":"Browning, K.A., Dillon, J.F., McQuistan, M.T., Wolfe, A.J.: An APN permutation in dimension six. Finite Fields: theory and applications, pp. 33\u201342 (2010)","DOI":"10.1090\/conm\/518\/10194"},{"key":"311_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44706-7_21","volume-title":"Fast Software Encryption","author":"L. Burnett","year":"2001","unstructured":"Burnett, L., Carter, G., Dawson, E., Millan, W.: Efficient methods for generating MARS-Like S-boxes. In: Proceedings of the 7th International Workshop on Fast Software Encryption, FSE \u201900, pp. 300\u2013314. Springer, London (2001). \nhttp:\/\/dl.acm.org\/citation.cfm?id=647935.740914"},{"key":"311_CR8","first-page":"373","volume-title":"Lecture Notes in Computer Science","author":"Anne Canteaut","year":"2016","unstructured":"Canteaut, A., Duval, S., Leurent, G.: Construction of lightweight S-boxes using Feistel and MISTY structures. In: Dunkelman, O., Keliher, L. (eds.) Selected Areas in Cryptography - SAC 2015: 22nd International Conference, Sackville, NB, Canada, August 12\u201314, 2015, Revised Selected Papers, pp. 373\u2013393. Springer International Publishing, Cham (2016)"},{"key":"311_CR9","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 1st edn, pp. 257\u2013397. Cambridge University Press, New York (2010)","DOI":"10.1017\/CBO9780511780448.011"},{"key":"311_CR10","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 1st edn, pp. 398\u2013469. Cambridge University Press, New York (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"311_CR11","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0053450","volume-title":"Advances in Cryptology \u2014 EUROCRYPT'94","author":"Florent Chabaud","year":"1995","unstructured":"Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201994: Workshop on the Theory and Application of Cryptographic Techniques Perugia, Italy, 1994 Proceedings, pp. 356\u2013365. Springer, Berlin (1995)"},{"key":"311_CR12","unstructured":"Claesen, L., Daemen, J., Genoe, M., Peeters, G.: Subterranean: a 600 Mbit\/sec cryptographic VLSI chip. In: 1993 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1993. ICCD \u201993. Proceedings, pp. 610\u2013613 (1993)"},{"issue":"3","key":"311_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF03037656","volume":"23","author":"JA Clark","year":"2005","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: The design of S-boxes by simulated annealing. N. Gener. Comput. 23(3), 219\u2013231 (2005). \nhttps:\/\/doi.org\/10.1007\/BF03037656","journal-title":"N. Gener. Comput."},{"key":"311_CR14","unstructured":"Daemen, J., Clapp, C.S.K.: Fast hashing and stream encryption with PANAMA. In: Fast Software Encryption, 5th International Workshop, FSE \u201998, Paris, France, March 23\u201325, 1998, Proceedings, pp. 60\u201374 (1998)"},{"key":"311_CR15","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"Joan Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, New York, Secaucus (2002)"},{"issue":"2","key":"311_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0096-3003(94)90087-6","volume":"62","author":"J Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Invertible shift-invariant transformations on binary arrays. Appl. Math. Comput. 62(2), 259\u2013277 (1994). \nhttps:\/\/doi.org\/10.1016\/0096-3003(94)90087-6","journal-title":"Appl. Math. Comput."},{"key":"311_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-58108-1_2","volume-title":"Fast Software Encryption","author":"Joan Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: A new approach to block cipher design. In: Anderson, R. (ed.) Fast Software Encryption: Cambridge Security Workshop Cambridge, U. K.,1993 Proceedings, pp. 18\u201332. Springer, Berlin (1994)"},{"key":"311_CR18","unstructured":"Dobraunig, C., Eichlseder, M., Schl\u00e4ffer, F.M., Ascon, M.: CAESAR submission, \nhttp:\/\/ascon.iaik.tugraz.at\/\n\n (2014)"},{"key":"311_CR19","doi-asserted-by":"crossref","unstructured":"Gutowitz, H.: Cryptography with dynamical systems. In: Cellular Automata and Cooperative Systems, pp. 237\u2013274. Springer (1993)","DOI":"10.1007\/978-94-011-1691-6_21"},{"key":"311_CR20","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. Inf. Sci. 201, 93\u2013113 (2012). \nhttps:\/\/doi.org\/10.1016\/j.ins.2012.02.030","journal-title":"Inf. Sci."},{"key":"311_CR21","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17342-4","volume-title":"The Block Cipher Companion","author":"Lars R. Knudsen","year":"2011","unstructured":"Knudsen, L.R., Robshaw, M.: The Block Cipher Companion. Information Security and Cryptography. Springer, Berlin (2011)"},{"key":"311_CR22","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"311_CR23","doi-asserted-by":"crossref","unstructured":"Leander, G., Poschmann, A.: On the classification of 4 bit s-boxes. In: Carlet, C., Sunar, B. (eds.) Arithmetic of Finite Fields, Lecture Notes in Computer Science, vol. 4547, pp. 159\u2013176. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73074-3_13"},{"issue":"3","key":"311_CR24","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11047-017-9635-0","volume":"17","author":"Luca Mariot","year":"2017","unstructured":"Mariot, L., Leporati, A.: A cryptographic and coding-theoretic perspective on the global rules of cellular automata. Nat. Comput. \nhttps:\/\/doi.org\/10.1007\/s11047-017-9635-0\n\n (2017)","journal-title":"Natural Computing"},{"key":"311_CR25","unstructured":"McEliece, R.J.: Theory of Information and Coding, 2nd edn. Cambridge University Press, New York (2001)"},{"key":"311_CR26","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: On the construction of highly nonlinear permutations. In: Rueppel, R. (ed.) Advances in Cryptology - EUROCRYPT\u2019 92, Lecture Notes in Computer Science, vol. 658, pp. 92\u201398. Springer, Berlin (1993)","DOI":"10.1007\/3-540-47555-9_8"},{"key":"311_CR27","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: S-boxes and round functions with controllable linearity and differential uniformity. In: Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14\u201316 December 1994, Proceedings, pp. 111\u2013130 (1994)","DOI":"10.1007\/3-540-60590-8_9"},{"key":"311_CR28","doi-asserted-by":"crossref","unstructured":"Picek, S., Miller, J.F., Jakobovic, D., Batina, L.: Cartesian genetic programming approach for generating substitution boxes of different sizes. In: GECCO Companion \u201915, pp. 1457\u20131458. ACM, New York (2015)","DOI":"10.1145\/2739482.2764698"},{"issue":"4","key":"311_CR29","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1162\/EVCO_a_00191","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Cupic, M., Rotim, L.: A new cost function for evolution of S-boxes. Evol. Comput. 24(4), 695\u2013718 (2016)","journal-title":"Evol. Comput."},{"key":"311_CR30","doi-asserted-by":"crossref","unstructured":"Picek, S., Mariot, L., Leporati, A., Jakobovic, D.: Evolving S-boxes based on cellular automata with genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO \u201917, pp. 251\u2013252. ACM, New York (2017)","DOI":"10.1145\/3067695.3076084"},{"key":"311_CR31","doi-asserted-by":"crossref","unstructured":"Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N.: Design of S-boxes defined with cellular automata rules. In: Proceedings of the Computing Frontiers Conference, CF\u201917, pp. 409\u2013414. ACM, New York (2017)","DOI":"10.1145\/3075564.3079069"},{"key":"311_CR32","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises Ltd, UK (2008)"},{"key":"311_CR33","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. Published via \nhttp:\/\/lulu.com\n\n and freely available at \nhttp:\/\/www.gp-field-guide.org.uk\n\n (With contributions by J. R. Koza) (2008)"},{"issue":"6","key":"311_CR34","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2007.09.012 https:\/\/doi.org10.\/1016\/j.ipl.2007.09.012","volume":"106","author":"V Rijmen","year":"2008","unstructured":"Rijmen, V., Barreto, P.S.L.M., Filho, D.L.G.: Rotation symmetry in algebraically generated cryptographic substitution tables. Inf. Process. Lett. 106(6), 246\u2013250 (2008). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2007.09.012","journal-title":"Inf. Process. Lett."},{"key":"311_CR35","unstructured":"Seredynski, M., Bouvry, P.: Block encryption using reversible cellular automata. In: Cellular Automata, 6th International Conference on Cellular Automata for Research and Industry, ACRI 2004, Amsterdam, The Netherlands, October 25\u201328, 2004, Proceedings, pp. 785\u2013792 (2004)"},{"issue":"4","key":"311_CR36","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28 (4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"311_CR37","first-page":"19","volume":"5","author":"K Sutner","year":"1991","unstructured":"Sutner, K.: De bruijn graphs and linear cellular automata. Complex Syst. 5(1), 19\u201330 (1991)","journal-title":"Complex Syst."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0311-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0311-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0311-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T06:13:55Z","timestamp":1580364835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0311-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,21]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0311-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2018,5,21]]},"assertion":[{"value":"26 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}