{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T17:22:07Z","timestamp":1763400127136,"version":"3.40.5"},"reference-count":16,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p>Commonly modern symmetric encryption schemes (e.g. AES) use rather simple actions repeated many times by defining several rounds to calculate the ciphertext. An idea we previously offered was to trade these multiple repeats for one non-linear operation. Recently we proposed a perfectly secure symmetric encryption scheme based on the matrix power function (MPF). However, the platform group we used was commuting. In this paper, we use a non-commuting group whose cardinality is a power of 2 as a platform for MPF. Due to the convenient cardinality value, our scheme is more suitable for practical implementation. Moreover, due to the non-commuting nature of the platform group, some \u201cnatural\u201d constraints on the power matrices arise. We think that this fact complicates the cryptanalysis of our proposal. We demonstrate that the newly defined symmetric cipher possesses are perfectly secure as they were previously done for the commuting platform group. Furthermore, we show that the same secret key can be used multiple times to encrypt several plaintexts without loss of security. Relying on the proven properties we construct the cipher block chaining mode of the initial cipher and show that it can withstand an adaptive chosen plaintext attack.<\/jats:p>","DOI":"10.15388\/22-infor499","type":"journal-article","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T13:15:37Z","timestamp":1670591737000},"page":"833-856","source":"Crossref","is-referenced-by-count":2,"title":["CBC Mode of MPF Based Shannon Cipher Defined Over a Non-Commuting Platform Group"],"prefix":"10.15388","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8661-3021","authenticated-orcid":false,"given":"Aleksejus","family":"Mihalkovich","sequence":"first","affiliation":[]},{"given":"Matas","family":"Levinskas","sequence":"additional","affiliation":[]},{"given":"Lina","family":"Dindiene","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-4469","authenticated-orcid":false,"given":"Eligijus","family":"Sakalauskas","sequence":"additional","affiliation":[]}],"member":"6097","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"2022121916251630464_j_infor499_ref_001"},{"first-page":"2631","volume-title":"Proceedings of the American Mathematical Society, AMS \u201996","year":"1996","key":"2022121916251630464_j_infor499_ref_002"},{"key":"2022121916251630464_j_infor499_ref_003","first-page":"846","article-title":"Galois realizability of groups of order 64","volume":"8(5)","year":"2010","journal-title":"Central European Journal of Mathematics"},{"issue":"2","key":"2022121916251630464_j_infor499_ref_004","doi-asserted-by":"crossref","first-page":"244","DOI":"10.2478\/s11533-009-0072-x","article-title":"Realizability and automatic realizability of Galois groups of order 32","volume":"8","year":"2010","journal-title":"Central European Journal of Mathematics"},{"volume-title":"Introduction to Modern Cryptography","year":"2007","key":"2022121916251630464_j_infor499_ref_005"},{"issue":"3","key":"2022121916251630464_j_infor499_ref_006","doi-asserted-by":"publisher","first-page":"50","DOI":"10.21595\/mme.2021.22234","article-title":"Avalanche effect and bit independence criterion of perfectly secure Shannon cipher based on matrix power","volume":"7","year":"2021","journal-title":"Mathematical Models in Engineering"},{"issue":"1","key":"2022121916251630464_j_infor499_ref_007","first-page":"1","article-title":"Groups of order 32 as Galois groups","volume":"33","year":"2007","journal-title":"Serdica Mathematical Journal"},{"key":"2022121916251630464_j_infor499_ref_008","doi-asserted-by":"crossref","first-page":"7","DOI":"10.15388\/LMR.A.2018.02","article-title":"On the associativity property of MPF over M16","volume":"59","year":"2018","journal-title":"Lietuvos matematikos rinkinys: Lietuvos matematiku draugijos darbai, Serija A"},{"issue":"2","key":"2022121916251630464_j_infor499_ref_009","doi-asserted-by":"publisher","first-page":"15","DOI":"10.21595\/mme.2022.22517","article-title":"MPF based symmetric cipher performance comparison to AES and TDES","volume":"8","year":"2022","journal-title":"Mathematical Models in Engineering"},{"key":"2022121916251630464_j_infor499_ref_010","doi-asserted-by":"publisher","DOI":"10.3390\/sym12091389","article-title":"Key exchange protocol defined over a non-commuting group based on an NP-complete decisional problem","volume":"12","year":"2020","journal-title":"Symmetry"},{"issue":"4","key":"2022121916251630464_j_infor499_ref_011","first-page":"2655","article-title":"Matrix power function and its application to block cipher s-box construction","volume":"8","year":"2012","journal-title":"International Journal of Innovative Computing, Information and Control"},{"issue":"11","key":"2022121916251630464_j_infor499_ref_012","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3390\/sym10110571","article-title":"MPF problem over modified medial semigroup is NP-complete","volume":"10","year":"2018","journal-title":"Symmetry"},{"issue":"4","key":"2022121916251630464_j_infor499_ref_013","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1049\/iet-ifs.2019.0333","article-title":"Security analysis of KAP based on enhanced MPF","volume":"14","year":"2020","journal-title":"IET Information Security"},{"key":"2022121916251630464_j_infor499_ref_014","doi-asserted-by":"publisher","first-page":"860","DOI":"10.3390\/sym12050860","article-title":"Perfectly secure Shannon Cipher construction based on the matrix power function","volume":"12","year":"2020","journal-title":"Symmetry"},{"issue":"4","key":"2022121916251630464_j_infor499_ref_015","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","year":"1949","journal-title":"The Bell System Technical Journal"},{"key":"2022121916251630464_j_infor499_ref_016","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/BF01442913","article-title":"Th\u00e9or\u00e8mes sur les groupes de substitutions","volume":"5","year":"1872","journal-title":"Mathematische Annalen"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1277\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1277\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T06:38:41Z","timestamp":1671518321000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/22-INFOR499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":16,"alternative-id":["10.15388\/22-INFOR499"],"URL":"https:\/\/doi.org\/10.15388\/22-infor499","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"type":"print","value":"0868-4952"},{"type":"electronic","value":"1822-8844"}],"subject":[],"published":{"date-parts":[[2022]]}}}