{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:16:12Z","timestamp":1764364572062,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.<\/jats:p>","DOI":"10.3390\/sym13091683","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T03:46:14Z","timestamp":1631591174000},"page":"1683","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sigma Identification Protocol Construction Based on MPF"],"prefix":"10.3390","volume":"13","author":[{"given":"Eligijus","family":"Sakalauskas","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Kaunas University of Technology, K. Donelaicio Str. 73, 44249 Kaunas, Lithuania"}]},{"given":"Inga","family":"Timofejeva","sequence":"additional","affiliation":[{"name":"Center for Nonlinear Systems, Kaunas University of Technology, Studentu 50-147, 51368 Kaunas, Lithuania"}]},{"given":"Ausrys","family":"Kilciauskas","sequence":"additional","affiliation":[{"name":"Department of Applied Informatics, Vytautas Magnus University, K. Donelai\u010dio Str. 58, 44248 Kaunas, Lithuania"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"key":"ref_1","unstructured":"Myasnikov, A., Shpilrain, V., and Ushakov, A. (2008). Group-Based Cryptography, Springer Science & Business Media."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Myasnikov, A.G., Shpilrain, V., and Ushakov, A. (2011). Non-Commutative Cryptography and Complexity of Group-Theoretic Problems, American Mathematical Society.","DOI":"10.1090\/surv\/177"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_4","unstructured":"Garey, M., and Johnson, D. (1979). Computers and Intractability: A Guide to Theory of NP-Completeness, H. Freeman."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chen, L., Jordan, S., Liu, Y., Moody, D., Peralta, R., Perlner, R., and Smith-Tone, D. (2016). Report on Post-Quantum Cryptography.","DOI":"10.6028\/NIST.IR.8105"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Micciancio, D., and Regev, O. (2009). Lattice-based cryptography. Post-Quantum Cryptography, Springer.","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Patarin, J., and Goubin, L. (1997, January 11\u201314). Trapdoor One-Way Permutations and Multivariate Polynomials. Proceedings of the First International Conference on Information and Communication Security, LNCS, Beijing, China.","DOI":"10.1007\/BFb0028491"},{"key":"ref_8","unstructured":"Wolf, C. (2002). Hidden Field Equations. (HFE)-Variations and Attacks. [Ph.D. Thesis, Ruhr-University]."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Faugere, J., and Antoine, J. (2003). Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Grobner bases. Advances in Cryptology-CRYPTO, Springer.","DOI":"10.1007\/978-3-540-45146-4_3"},{"key":"ref_10","unstructured":"Yasuda, T., Dahan, X., Huang, Y.-J., Takagi, T., and Sakurai, K. (2021, July 01). MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems. Available online: http:\/\/eprint.iacr.org\/2015\/275.pdf."},{"key":"ref_11","first-page":"33","article-title":"The Multivariate Quadratic Power Problem over Zn is NP-complete","volume":"41","author":"Sakalauskas","year":"2012","journal-title":"Inf. Technol. Control"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Sakalauskas, E., and Mihalkovich, A. (2018). MPF Problem over Modified Medial Semigroup Is NP-complete. Symmetry, 10.","DOI":"10.3390\/sym10110571"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Mihalkovich, A., Sakalauskas, E., and Luksys, K. (2020). Key Exchange Protocol Defined over a Non-Commuting Group Based on an NP-complete Decisional Problem. Symmetry, 12.","DOI":"10.3390\/sym12091389"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Sakalauskas, E. (2018). Enhanced matrix power function for cryptographic primitive construction. Symmetry, 10.","DOI":"10.3390\/sym10020043"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10958-013-1588-y","article-title":"Categorical interpretations of some key agreement protocols","volume":"195","author":"Inassaridze","year":"2013","journal-title":"J. Math. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Horn, R.A., and Johnson, C.R. (2012). Matrix Analysis, Cambridge University Press.","DOI":"10.1017\/CBO9781139020411"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0021-8693(69)90013-1","article-title":"On medial semigroups","volume":"12","author":"Chrislock","year":"1969","journal-title":"J. Algebra"},{"key":"ref_18","unstructured":"Krishna, K.V. (2005). Near-Semirings: Theory and Application. [Ph.D. Thesis, IIT Delhi]."},{"key":"ref_19","unstructured":"Boneh, D., and Shoup, V. (2021, July 01). A Graduate Course in Applied Cryptography. Available online: https:\/\/toc.cryptobook.us\/book.pdf."},{"key":"ref_20","unstructured":"Pierre, A.G. (2017). Semigroups: An Introduction to the Structure Theory, Routledge."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1683\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:01:50Z","timestamp":1760166110000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":20,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["sym13091683"],"URL":"https:\/\/doi.org\/10.3390\/sym13091683","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,9,13]]}}}