{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:18Z","timestamp":1740099558090,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302740"},{"type":"electronic","value":"9783030302757"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30275-7_16","type":"book-chapter","created":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T19:20:05Z","timestamp":1570044005000},"page":"197-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Investigation of Matrix Power Asymmetric Cipher Resistant to Linear Algebra Attack"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8661-3021","authenticated-orcid":false,"given":"Aleksejus","family":"Mihalkovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matas","family":"Levinskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"issue":"6","key":"16_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology, CRYPTO 1984","author":"NR Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A Public-key cryptosystem based on the word problem. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology, CRYPTO 1984. Lecture Notes in Computer Science, vol. 196, pp. 19\u201336. Springer, Berlin (1985)"},{"key":"16_CR3","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, 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.) Advances in Cryptology \u2014 CRYPTO 2000, CRYPTO 2000. Lecture Notes in Computer Science, vol. 1880, pp. 166\u2013183. Springer, Berlin (2000)"},{"key":"16_CR4","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, 287\u2013292 (1999)","journal-title":"Math. Res. Lett."},{"issue":"3\u20134","key":"16_CR5","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."},{"issue":"4","key":"16_CR6","first-page":"2655","volume":"8","author":"E Sakalauskas","year":"2012","unstructured":"Sakalauskas, E., Luksys, K.: Matrix power function and its application to block cipher S-box construction. Int. J. Innovative Comput. Inf. Control 8(4), 2655\u20132664 (2012)","journal-title":"Int. J. Innovative Comput. Inf. Control"},{"key":"16_CR7","unstructured":"Sakalauskas, E., Listopadskis, N., Tvarijonas, P.: Key agreement protocol (KAP) based on matrix power function. In: Sixth International Conference on Information Research and Applications \u2013 i.Tech 2008, Varna, Bulgaria (2008)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Mihalkovi\u010d, A., Sakalauskas, E.: Asymmetric cipher based on MPF and its security parameters evaluation. In: Proceedings of the Lithuanian Mathematical Society, Series A, vol. 53, pp. 72\u201377 (2012)","DOI":"10.15388\/LMR.A.2012.13"},{"key":"16_CR9","unstructured":"Sakalauskas, E., Mihalkovich, A.: Candidate one-way function based on matrix power function with conjugation constraints. In: Proceedings of the Bulgarian Cryptography Days, pp. 29\u201337 (2012)"},{"issue":"2","key":"16_CR10","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"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","first-page":"343","volume-title":"Information Security and Cryptology, Inscrypt 2016","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.) Information Security and Cryptology, Inscrypt 2016. Lecture Notes in Computer Science, vol. 10143, pp. 343\u2013354. Springer, Cham (2017)"},{"key":"16_CR12","unstructured":"Gantmakher, F.R.: The theory of matrices, vol. 131. American Mathematical Soc. (2000)"},{"issue":"3","key":"16_CR13","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"},{"key":"16_CR14","unstructured":"Jenkov.com Tech and Media Labs. http:\/\/tutorials.jenkov.com\/java-cryptography\/index.html"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30275-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,8]],"date-time":"2019-12-08T11:09:30Z","timestamp":1575803370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30275-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302740","9783030302757"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30275-7_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Software Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icist2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icist.ktu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}