{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:35:42Z","timestamp":1772807742187,"version":"3.50.1"},"reference-count":35,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019004","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T08:53:46Z","timestamp":1545209626000},"page":"67-88","source":"Crossref","is-referenced-by-count":8,"title":["Wave-shaped round functions and primitive groups"],"prefix":"10.3934","volume":"13","author":[{"given":"Riccardo","family":"Aragona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Calderini","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Bergen, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Civino","sequence":"additional","affiliation":[{"name":"DISIM, University of L'Aquila, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Sala","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Zappatore","sequence":"additional","affiliation":[{"name":"LIRMM of Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019004-1","doi-asserted-by":"crossref","unstructured":"C. Adams, The CAST-128 encryption algorithm, 1997, Available from: <a href=\"http:\/\/buildbot.tools.ietf.org\/html\/rfc2144\" target=\"_blank\">http:\/\/buildbot.tools.ietf.org\/html\/rfc2144<\/a>.","DOI":"10.17487\/rfc2144"},{"key":"key-10.3934\/amc.2019004-2","doi-asserted-by":"crossref","unstructured":"R. J. Anderson, E. Biham and L. R. Knudsen, SERPENT: A new block cipher proposal, <i>Fast Software Encryption<\/i>, Lecture Notes in Comput. Sci., <b>1372<\/b> (1998), 222-238.","DOI":"10.1007\/3-540-69710-1_15"},{"key":"key-10.3934\/amc.2019004-3","doi-asserted-by":"publisher","unstructured":"K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima and T. Tokita, Camellia: A 128-bit block cipher suitable for multiple platforms-design and analysis, <i>Selected Areas in Cryptography<\/i>, Lecture Notes in Comput. Sci., <b>2012<\/b> (2000), 39-56.","DOI":"10.1007\/3-540-44983-3_4"},{"key":"key-10.3934\/amc.2019004-4","doi-asserted-by":"publisher","unstructured":"R. Aragona, M. Calderini, A. Tortora and M. Tota, Primitivity of PRESENT and other lightweight ciphers, <i>J. Algebra Appl<\/i>., <b>17<\/b> (2018), 1850115 (16 pages).","DOI":"10.1142\/S0219498818501153"},{"key":"key-10.3934\/amc.2019004-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2013.10.005"},{"key":"key-10.3934\/amc.2019004-6","doi-asserted-by":"publisher","DOI":"10.1007\/s10231-016-0559-6"},{"key":"key-10.3934\/amc.2019004-7","doi-asserted-by":"crossref","unstructured":"A. Bannier, N. Bodin and E. Filiol, Partition-Based Trapdoor Ciphers, IACR Cryptology ePrint Archive, 2016, Available from: <a href=\"http:\/\/eprint.iacr.org\/2016\/493\" target=\"_blank\">http:\/\/eprint.iacr.org\/2016\/493<\/a>.","DOI":"10.5772\/intechopen.70420"},{"key":"key-10.3934\/amc.2019004-8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00630563"},{"key":"key-10.3934\/amc.2019004-9","doi-asserted-by":"crossref","unstructured":"A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann, M. J. B. Robshaw, Y. Seurin and C. Vikkelsoe, PRESENT: An ultra-lightweight block cipher, <i>CHES '07<\/i>, Lecture Notes in Comput. Sci., <b>4727<\/b> (2007), 450-466.","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"key-10.3934\/amc.2019004-10","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/518\/10194"},{"key":"key-10.3934\/amc.2019004-11","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018030"},{"key":"key-10.3934\/amc.2019004-12","unstructured":"M. Calderini and M. Sala, Elementary abelian regular subgroups as hidden sums for cryptographic trapdoors, preprint, arXiv: 1702.00581."},{"key":"key-10.3934\/amc.2019004-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.02.001"},{"key":"key-10.3934\/amc.2019004-14","doi-asserted-by":"publisher","unstructured":"P. J. Cameron, <i>Permutation Groups<\/i>, London Mathematical Society Student Texts, <b>45<\/b>, Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/CBO9780511623677"},{"key":"key-10.3934\/amc.2019004-15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2676807"},{"key":"key-10.3934\/amc.2019004-16","doi-asserted-by":"publisher","unstructured":"A. Canteaut and M. Naya-Plasencia, Structural weaknesses of permutations with low differential uniformity and generalized crooked functions, <i>Finite Fields: Theory and Applications Selected Papers from the 9th International Conference Finite Fields and Applications<\/i>, Contemporary Mathematics, <b>518<\/b> (2010), 55-71.","DOI":"10.1090\/conm\/518\/10196"},{"key":"key-10.3934\/amc.2019004-17","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9283-1"},{"key":"key-10.3934\/amc.2019004-18","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-009-0100-x"},{"key":"key-10.3934\/amc.2019004-19","doi-asserted-by":"publisher","DOI":"10.1137\/0129051"},{"key":"key-10.3934\/amc.2019004-20","doi-asserted-by":"publisher","unstructured":"J. Daemen and V. Rijmen, <i>The design of Rijndael: AES - the Advanced Encryption Standard<\/i>, Information Security and Cryptography, Springer-Verlag, Berlin, 2002.","DOI":"10.1007\/978-3-662-04722-4"},{"key":"key-10.3934\/amc.2019004-21","doi-asserted-by":"crossref","unstructured":"V. Dolmatov, GOST 28147-89: encryption, decryption, and message authentication code (MAC) algorithms, technical report, 2010. Available at <a href=\"http:\/\/tools.ietf.org\/html\/rfc5830\" target=\"_blank\">http:\/\/tools.ietf.org\/html\/rfc5830<\/a>.","DOI":"10.17487\/rfc5830"},{"key":"key-10.3934\/amc.2019004-22","unstructured":"Federal information processing standards publication, <i>Data Encryption Standard and Others<\/i>, National Bureau of Standards, US Department of Commerce, 1977."},{"key":"key-10.3934\/amc.2019004-23","doi-asserted-by":"publisher","DOI":"10.24033\/asens.317"},{"key":"key-10.3934\/amc.2019004-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.022"},{"key":"key-10.3934\/amc.2019004-25","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206323"},{"key":"key-10.3934\/amc.2019004-26","doi-asserted-by":"crossref","unstructured":"M. Matsui, Linear Cryptanalysis Method for DES Cipher, <i>Advances in cryptology - EUROCRYPT '93<\/i>, Lecture Notes in Comput. Sci., 765 (1994), 386-397.","DOI":"10.1007\/3-540-48285-7_33"},{"key":"key-10.3934\/amc.2019004-27","doi-asserted-by":"publisher","unstructured":"K. Nyberg, Differentially uniform mappings for cryptography, <i>Advances in cryptology - EUROCRYPT '93<\/i>, Lecture Notes in Comput. Sci., <b>765<\/b> (1994), 55-64.","DOI":"10.1007\/3-540-48285-7_6"},{"key":"key-10.3934\/amc.2019004-28","doi-asserted-by":"crossref","unstructured":"K. G. Paterson, Imprimitive permutation groups and trapdoors in iterated block ciphers, <i>Fast Software Encryption<\/i>, Lecture Notes in Comput. Sci., <b>1636<\/b> (1999), 201-214.","DOI":"10.1007\/3-540-48519-8_15"},{"key":"key-10.3934\/amc.2019004-29"},{"key":"key-10.3934\/amc.2019004-30","doi-asserted-by":"crossref","unstructured":"G. Piret, T. Roche and C. Carlet, PICARO-a block cipher allowing efficient higher-order sidechannel resistance, <i>Applied Cryptography and Network Security-ACNS2012<\/i>, Lecture Notes in Comput. Sci., <b>7341<\/b> (2012), 311-328.","DOI":"10.1007\/978-3-642-31284-7_19"},{"key":"key-10.3934\/amc.2019004-31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"key-10.3934\/amc.2019004-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.011"},{"key":"key-10.3934\/amc.2019004-33","doi-asserted-by":"crossref","unstructured":"R. Wernsdorf, The round functions of RIJNDAEL generate the alternating group, Fast Software Encryption, Lecture Notes in Comput. Sci., <b>2365<\/b> (2002), 143-148.","DOI":"10.1007\/3-540-45661-9_11"},{"key":"key-10.3934\/amc.2019004-34","doi-asserted-by":"publisher","unstructured":"R. Wernsdorf, The one-round functions of the DES generate the alternating group, <i>Advances in Cryptology-EUROCRYPT '92<\/i>, Lecture Notes in Comput. Sci., <b>658<\/b> (1993), 99-112.","DOI":"10.1007\/3-540-47555-9_9"},{"key":"key-10.3934\/amc.2019004-35","unstructured":"R. Wernsdorf, The round functions of SERPENT generate the alternating group, 2000. Available from: <a href=\"http:\/\/csrc.nist.gov\/archive\/aes\/round2\/comments\/20000512-rwernsdorf.pdf\" target=\"_blank\">http:\/\/csrc.nist.gov\/archive\/aes\/round2\/comments\/20000512-rwernsdorf.pdf<\/a>."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2019_1_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:03:40Z","timestamp":1772791420000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019004","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}