{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:05:59Z","timestamp":1772805959303,"version":"3.50.1"},"reference-count":21,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2018]]},"DOI":"10.3934\/amc.2018030","type":"journal-article","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T04:32:34Z","timestamp":1533357154000},"page":"515-524","source":"Crossref","is-referenced-by-count":5,"title":["A note on some algebraic trapdoors for block ciphers"],"prefix":"10.3934","volume":"12","author":[{"given":"Marco","family":"Calderini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2018030-1","doi-asserted-by":"crossref","unstructured":"R. Anderson, E. Biham and L. Knudsen, SERPENT: A new block cipher proposal, <i>in: FastSoftware Encryption, LNCS, Springer, Berlin<\/i>, <b>1372<\/b> (1998), 222\u2013238.","DOI":"10.1007\/3-540-69710-1_15"},{"key":"key-10.3934\/amc.2018030-2","doi-asserted-by":"publisher","unstructured":"R. Aragona, M. Calderini, A. Tortora and M. Tota, Primitivity of PRESENT and other lightweight ciphers,  <i>Journal of Algebra and Its Applications<\/i>, <b>17<\/b> (2018), 1850115, 16pp.","DOI":"10.1142\/S0219498818501153"},{"key":"key-10.3934\/amc.2018030-3","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-016-0285-8"},{"key":"key-10.3934\/amc.2018030-4","doi-asserted-by":"publisher","DOI":"10.1007\/s10231-016-0559-6"},{"key":"key-10.3934\/amc.2018030-5","doi-asserted-by":"crossref","unstructured":"A. Bannier, N. Bodin and E. Filiol, Partition-Based Trapdoor Ciphers, preprint, <a href=\"https:\/\/eprint.iacr.org\/2016\/493.pdf\" target=\"_blank\">https:\/\/eprint.iacr.org\/2016\/493.pdf<\/a>.","DOI":"10.5772\/intechopen.70420"},{"key":"key-10.3934\/amc.2018030-6","doi-asserted-by":"crossref","unstructured":"A. Bannier and E. Filiol,  <i>Partition-based Trapdoor Ciphers<\/i>, Partition-Based Trapdoor Ciphers. InTech, 2017.","DOI":"10.5772\/intechopen.70420"},{"key":"key-10.3934\/amc.2018030-7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00630563"},{"key":"key-10.3934\/amc.2018030-8","doi-asserted-by":"publisher","unstructured":"A. Andrey 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, in: <i>Proc. ofCHES 2007, LNCS, Springer<\/i>, <b>4727<\/b> (2007), 450\u2013466.","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"key-10.3934\/amc.2018030-9","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-009-0100-x"},{"key":"key-10.3934\/amc.2018030-10","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9283-1"},{"key":"key-10.3934\/amc.2018030-11","doi-asserted-by":"publisher","DOI":"10.1137\/0129051"},{"key":"key-10.3934\/amc.2018030-12","doi-asserted-by":"publisher","unstructured":"J. Daemen and V. Rijmen,  <i>The Design of Rijndael: AES-the Advanced Encryption Standard<\/i>, Springer Science &amp; Business Media, 2002.","DOI":"10.1007\/978-3-662-04722-4"},{"key":"key-10.3934\/amc.2018030-13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056752"},{"key":"key-10.3934\/amc.2018030-14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052331"},{"key":"key-10.3934\/amc.2018030-15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206323"},{"key":"key-10.3934\/amc.2018030-16","doi-asserted-by":"publisher","unstructured":"M. Matsui, Linear Cryptanalysis Method for DES Cipher, <i>Advances in Cryptology \u2013 EUROCRYPT '93, LNCS, Springer, Berlin<\/i>, <b>765<\/b> (1994), 386\u2013397.","DOI":"10.1007\/3-540-48285-7_33"},{"key":"key-10.3934\/amc.2018030-17","doi-asserted-by":"publisher","unstructured":"K. G. Paterson, Imprimitive permutation groups and trapdoors in iterated block ciphers, in: <i>Fast Software Encryption, LNCS, Springer, Berlin<\/i>, <b>1636<\/b> (1999), 201\u2013214.","DOI":"10.1007\/3-540-48519-8_15"},{"key":"key-10.3934\/amc.2018030-18","doi-asserted-by":"publisher","DOI":"10.1007\/BF00195210"},{"key":"key-10.3934\/amc.2018030-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.011"},{"key":"key-10.3934\/amc.2018030-20","unstructured":"R. Wernsdorf,  <i>The round functions of SERPENT generate the alternating group<\/i>, 2000; available at <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>."},{"key":"key-10.3934\/amc.2018030-21","doi-asserted-by":"publisher","unstructured":"R. Wernsdorf, The round functions of RIJNDAEL generate the alternating group, <i>Fast Software Encryption, LNCS, Springer, Berlin<\/i>, <b>2365<\/b> (2002), 143\u2013148.","DOI":"10.1007\/3-540-45661-9_11"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2018_3_515.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:59:08Z","timestamp":1772791148000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2018030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2018030","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}