{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:50:06Z","timestamp":1743051006682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031104664"},{"type":"electronic","value":"9783031104671"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10467-1_32","type":"book-chapter","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T17:03:56Z","timestamp":1657127036000},"page":"511-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Key Exchange Protocol Based on the Matrix Power Function Defined Over \"Equation missing\""],"prefix":"10.1007","author":[{"given":"Aleksejus","family":"Mihalkovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eligijus","family":"Sakalauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matas","family":"Levinskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02181-7_13","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"R \u00c1lvarez","year":"2009","unstructured":"\u00c1lvarez, R., Tortosa, L., Vicent, J., Zamora, A.: A Non-abelian group based on block upper triangular matrices with cryptographic applications. In: Bras-Amor\u00f3s, M., H\u00f8holdt, T. (eds.) AAECC 2009. LNCS, vol. 5527, pp. 117\u2013126. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02181-7_13"},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I Anshel","year":"1999","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public-key cryptography. Math. Res. Lett. 6(3), 287\u2013291 (1999)","journal-title":"Math. Res. Lett."},{"key":"32_CR3","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. 2020. Version 0.5 (2020)"},{"issue":"9","key":"32_CR4","doi-asserted-by":"publisher","first-page":"2631","DOI":"10.1090\/S0002-9939-96-03345-X","volume":"124","author":"H Grundman","year":"1996","unstructured":"Grundman, H., Smith, T.: Automatic realizability of galois groups of order 16. Proc. Am. Math. Soc. 124(9), 2631\u20132640 (1996)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20132","key":"32_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00607-009-0032-0","volume":"85","author":"LC Klingler","year":"2009","unstructured":"Klingler, L.C., Magliveras, S.S., Richman, F., Sramka, M.: Discrete logarithms for finite groups. Computing 85(1\u20132), 3 (2009)","journal-title":"Computing"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"KH Ko","year":"2000","unstructured":"Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public-key cryptosystem using braid groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 166\u2013183. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_10"},{"key":"32_CR7","unstructured":"Lanel, G., Jinasena T., Welihinda B.: A survey of public-key cryptography over non-abelian groups. IJCSNS 21(4), 289 (2021)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-54705-3_21","volume-title":"Information Security and Cryptology","author":"J Liu","year":"2017","unstructured":"Liu, J., Zhang, H., Jia, J.: A linear algebra attack on the non-commuting cryptography class based on matrix power function. In: Chen, K., Lin, D., Yung, M. (eds.) Inscrypt 2016. LNCS, vol. 10143, pp. 343\u2013354. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54705-3_21"},{"key":"32_CR9","unstructured":"Mihalkovich, A.: On the associativity property of mpf over m16"},{"key":"32_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-030-30275-7_16","volume-title":"Information and Software Technologies","author":"A Mihalkovich","year":"2019","unstructured":"Mihalkovich, A., Levinskas, M.: Investigation of matrix power asymmetric cipher resistant to linear algebra attack. In: Dama\u0161evi\u010dius, R., Vasiljevien\u0117, G. (eds.) ICIST 2019. CCIS, vol. 1078, pp. 197\u2013208. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30275-7_16"},{"key":"32_CR11","first-page":"72","volume":"53","author":"A Mihalkovich","year":"2012","unstructured":"Mihalkovich, A., Sakalauskas, E.: Asymmetric cipher based on MPF and its security parameters evaluation. Proc. Lithuanian Math. Soc. Ser. A 53, 72\u201377 (2012)","journal-title":"Proc. Lithuanian Math. Soc. Ser. A"},{"issue":"10","key":"32_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.5755\/j01.eee.19.10.5906","volume":"19","author":"A Mihalkovich","year":"2013","unstructured":"Mihalkovich, A., Sakalauskas, E., Venckauskas, A.: New asymmetric cipher based on matrix power function and its implementation in microprocessors efficiency investigation. Elektronika ir Elektrotechnika 19(10), 119\u2013122 (2013)","journal-title":"Elektronika ir Elektrotechnika"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0028491","volume-title":"Information and Communications Security","author":"J Patarin","year":"1997","unstructured":"Patarin, J., Goubin, L.: Trapdoor one-way permutations and multivariate polynomials. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 356\u2013368. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028491"},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3390\/sym10020043","volume":"10","author":"E Sakalauskas","year":"2018","unstructured":"Sakalauskas, E.: Enhanced matrix power function for cryptographic primitive construction. Symmetry 10(2), 43 (2018)","journal-title":"Symmetry"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Sakalauskas, E., Luksys, K.: Matrix power function and its application to block cipher s-box construction. Int. J. Inn. Comp., Inf. Contr. 8(4), 2655\u20132664 (2012)","DOI":"10.5755\/j01.itc.41.4.820"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.15388\/Informatica.2014.15","volume":"25","author":"E Sakalauskas","year":"2014","unstructured":"Sakalauskas, E., Mihalkovich, A.: New asymmetric cipher of non-commuting cryptography class based on matrix power function. Informatica 25(2), 283\u2013298 (2014)","journal-title":"Informatica"},{"issue":"3","key":"32_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.15388\/Informatica.2017.142","volume":"28","author":"E Sakalauskas","year":"2017","unstructured":"Sakalauskas, E., Mihalkovich, A.: Improved asymmetric cipher based on matrix power function resistant to linear algebra attack. Informatica 28(3), 517\u2013524 (2017)","journal-title":"Informatica"},{"issue":"11","key":"32_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3390\/sym10110571","volume":"10","author":"E Sakalauskas","year":"2018","unstructured":"Sakalauskas, E., Mihalkovich, A.: MPF problem over modified medial semigroup is np-complete. Symmetry 10(11), 571 (2018)","journal-title":"Symmetry"},{"key":"32_CR19","unstructured":"Sakalauskas, E., Listopadskis, N., Tvarijonas, P.: Key agreement protocol (KAP) based on matrix power function (2008)"},{"issue":"3\u20134","key":"32_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00200-006-0009-6","volume":"17","author":"V Shpilrain","year":"2006","unstructured":"Shpilrain, V., Ushakov, A.: The conjugacy search problem in public key cryptography: unnecessary and insufficient. Appl. Algebra Eng. Commun. Comput. 17(3\u20134), 285\u2013289 (2006)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"32_CR21","unstructured":"Stickel, E.: A new public-key cryptosystem in non abelian groups. Proceedings of the Thirteenth International Conference on Information Systems Development. Vilnius Technika: 70\u201380, Vilnius (2004)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10467-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T13:07:20Z","timestamp":1685797640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10467-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031104664","9783031104671"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10467-1_32","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}