{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:17:28Z","timestamp":1772806648585,"version":"3.50.1"},"reference-count":31,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019016","type":"journal-article","created":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T00:20:38Z","timestamp":1550535638000},"page":"235-251","source":"Crossref","is-referenced-by-count":1,"title":["Type-preserving matrices and security of block ciphers"],"prefix":"10.3934","volume":"13","author":[{"given":"Riccardo","family":"Aragona","sequence":"first","affiliation":[]},{"given":"Alessio","family":"Meneghetti","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Trento, Via Sommarive 14, 38123 Povo (TN), Italy"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019016-1","doi-asserted-by":"crossref","unstructured":"<p>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\u2013238.<\/p>","DOI":"10.1007\/3-540-69710-1_15"},{"key":"key-10.3934\/amc.2019016-2","doi-asserted-by":"crossref","unstructured":"<p>K. Aoki, et al., Camellia: A 128-bit block cipher suitable for multiple platforms-design andanalysis, <i>Selected Areas in Cryptography, Lecture Notes in Comput. Sci<\/i>., <b>2012<\/b> (2000), 39\u201356.<\/p>","DOI":"10.1007\/3-540-44983-3_4"},{"key":"key-10.3934\/amc.2019016-3","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2019004"},{"key":"key-10.3934\/amc.2019016-4","doi-asserted-by":"crossref","unstructured":"<p>R. Aragona, M. Calderini, A. Tortora and M. Tota, On the primitivity of PRESENT and other lightweight ciphers, <i>Journal of Algebra and Its Applications<\/i>, <b>17<\/b> (2018), 1850115 (16 pages).<\/p>","DOI":"10.1142\/S0219498818501153"},{"key":"key-10.3934\/amc.2019016-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2013.10.005"},{"key":"key-10.3934\/amc.2019016-6","doi-asserted-by":"publisher","DOI":"10.1007\/s10231-016-0559-6"},{"key":"key-10.3934\/amc.2019016-7","doi-asserted-by":"crossref","unstructured":"<p>A. Bannier, N. Bodin and E. Filiol, <i>Partition-Based Trapdoor Ciphers, <\/i>  IACR Cryptology ePrint Archive, 2016.<\/p>","DOI":"10.5772\/intechopen.70420"},{"key":"key-10.3934\/amc.2019016-8","doi-asserted-by":"crossref","unstructured":"<p>A. Bogdanov et al., PRESENT: An ultra-lightweight block cipher, <i>CHES '07, Lecture Notesin Comput. Sci<\/i>., <b>4727<\/b> (2007), 450\u2013466.<\/p>","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"key-10.3934\/amc.2019016-9","unstructured":"<p>C. Burwick, et al., MARS-a candidate cipher for AES, <i>NIST AES Proposal<\/i>, <b>268<\/b> (1998).<\/p>"},{"key":"key-10.3934\/amc.2019016-10","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018030"},{"key":"key-10.3934\/amc.2019016-11","unstructured":"<p>M. Calderini and M. Sala, Elementary abelian regular subgroups as hidden sums for cryptographic trapdoors, preprint, arXiv: 1702.00581, [math.GR], 2017.<\/p>"},{"key":"key-10.3934\/amc.2019016-12","unstructured":"<p>P. J. Cameron, <i>Permutation Groups<\/i>, London Mathematical Society Student Texts, <b>45<\/b>, Cambridge University Press, Cambridge, 1999.<\/p>"},{"key":"key-10.3934\/amc.2019016-13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9283-1"},{"key":"key-10.3934\/amc.2019016-14","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-009-0100-x"},{"key":"key-10.3934\/amc.2019016-15","doi-asserted-by":"publisher","DOI":"10.1137\/0129051"},{"key":"key-10.3934\/amc.2019016-16","doi-asserted-by":"crossref","unstructured":"<p>J. Daemen and V. Rijmen, <i>The design of Rijndael: AES \u2013 the Advanced Encryption Standard<\/i>, Information Security and Cryptography, Springer-Verlag, Berlin, 2002.<\/p>","DOI":"10.1007\/978-3-662-04722-4"},{"key":"key-10.3934\/amc.2019016-17","unstructured":"<p>S. M. Dehnavi, A. M. Rishakani, M. M. Shamsabad, H. Maimani and E. Pasha, <i>Cryptographic Properties of Addition Modulo<\/i> $2^n$, IACR Cryptology ePrint Archive, 2016.<\/p>"},{"key":"key-10.3934\/amc.2019016-18","doi-asserted-by":"crossref","unstructured":"<p>V. Dolmatov, GOST 2814789: Encryption, decryption, and message authentication code (MAC) algorithms, Technical report, 2010. Available from <a href=\"http:\/\/tools.ietf.org\/html\/rfc5830\" target=\"_blank\">http:\/\/tools.ietf.org\/html\/rfc5830<\/a>.<\/p>","DOI":"10.17487\/rfc5830"},{"key":"key-10.3934\/amc.2019016-19","doi-asserted-by":"publisher","DOI":"10.24033\/asens.317"},{"key":"key-10.3934\/amc.2019016-20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206323"},{"key":"key-10.3934\/amc.2019016-21","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-015-0136-7"},{"key":"key-10.3934\/amc.2019016-22","doi-asserted-by":"crossref","unstructured":"<p>X. Lai and J. L. Massey, A proposal for a new block encryption standard, <i>Advances in Cryptology \u2013 EUROCRYPT '90<\/i>, Lecture Notes in Comput. Sci., <b>473<\/b> (1990), 389\u2013404.<\/p>","DOI":"10.1007\/3-540-46877-3_35"},{"key":"key-10.3934\/amc.2019016-23","unstructured":"<p>D. Mukhopadhyay and D. RoyChowdhury, <i>Key Mixing in Block Ciphers through Addition modulo<\/i> $2^n$, IACR Cryptology ePrint Archive, 2005.<\/p>"},{"key":"key-10.3934\/amc.2019016-24","doi-asserted-by":"crossref","unstructured":"<p>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\u2013214.<\/p>","DOI":"10.1007\/3-540-48519-8_15"},{"key":"key-10.3934\/amc.2019016-25","unstructured":"<p>R. L. Rivest, M. J. W. Robshaw, R. Sidney and Y. L. Yin, The RC6$^{TM}$ block cipher, In <i>First Advanced Encryption Standard (AES) Conference<\/i>, (1998).<\/p>"},{"key":"key-10.3934\/amc.2019016-26","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"key-10.3934\/amc.2019016-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.011"},{"key":"key-10.3934\/amc.2019016-28","doi-asserted-by":"crossref","unstructured":"<p>F. X. Standaert, G. Piret, N. Gershenfeld and J. J. Quisquater, SEA: A scalable encryption algorithm for small embedded applications, <i>Smart Card Research and Advanced Applications \u2013 CARDIS '06<\/i>, Lecture Notes in Comput. Sci.  <b>3928<\/b> (2006), 222\u2013236.<\/p>","DOI":"10.1007\/11733447_16"},{"key":"key-10.3934\/amc.2019016-29","doi-asserted-by":"crossref","unstructured":"<p>R. Wernsdorf, The round functions of RIJNDAEL generate the alternating group, <i>Fast Software Encryption<\/i>, Lecture Notes in Comput. Sci.  <b>2365<\/b> (2002), 143\u2013148.<\/p>","DOI":"10.1007\/3-540-45661-9_11"},{"key":"key-10.3934\/amc.2019016-30","doi-asserted-by":"crossref","unstructured":"<p>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\u2013112.<\/p>","DOI":"10.1007\/3-540-47555-9_9"},{"key":"key-10.3934\/amc.2019016-31","unstructured":"<p>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>.<\/p>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2019_2_235.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:00:47Z","timestamp":1772791247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019016","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}