{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:14:29Z","timestamp":1742919269703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489808"},{"type":"electronic","value":"9783031489815"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48981-5_2","type":"book-chapter","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T11:02:35Z","timestamp":1704798155000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Investigation of the Statistical Properties of the CTR Mode of the Block Cipher Based on MPF"],"prefix":"10.1007","author":[{"given":"Matas","family":"Levinskas","sequence":"first","affiliation":[]},{"given":"Aleksejus","family":"Mihalkovich","sequence":"additional","affiliation":[]},{"given":"Lina","family":"Dindiene","sequence":"additional","affiliation":[]},{"given":"Eligijus","family":"Sakalauskas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"key":"2_CR1","unstructured":"Lardinois, F.: IBM Unveils Its 433 Qubit Osprey Quantum Computer. TechCrunch (2022)"},{"key":"2_CR2","unstructured":"Sakalauskas, E., Luksys, K.: Matrix Power S-Box Construction. Cryptol. EPrint Arch. (2007)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"860","DOI":"10.3390\/sym12050860","volume":"12","author":"E Sakalauskas","year":"2020","unstructured":"Sakalauskas, E., Dindien\u0117, L., Kil\u010diauskas, A., Luk\u0161ys, K.: Perfectly secure Shannon cipher construction based on the matrix power function. Symmetry 12, 860 (2020)","journal-title":"Symmetry"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.3390\/math10122123","volume":"10","author":"L Dindiene","year":"2022","unstructured":"Dindiene, L., Mihalkovich, A., Luksys, K., Sakalauskas, E.: Matrix power function based block cipher operating in CBC mode. Mathematics 10, 2123 (2022). https:\/\/doi.org\/10.3390\/math10122123","journal-title":"Mathematics"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Mihalkovich, A., Levinskas, M., Dindiene, L., Sakalauskas, E.: CBC mode of MPF based Shannon cipher defined over a non-commuting platform group. Informatica 33, 833\u2013856 (2022). https:\/\/doi.org\/10.15388\/22-INFOR499","DOI":"10.15388\/22-INFOR499"},{"key":"2_CR6","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography. 900"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"3363","DOI":"10.3390\/math10183363","volume":"10","author":"A Mihalkovich","year":"2022","unstructured":"Mihalkovich, A., Levinskas, M., Sakalauskas, E.: Counter mode of the Shannon block cipher based on MPF defined over a non-commuting group. Mathematics 10, 3363 (2022). https:\/\/doi.org\/10.3390\/math10183363","journal-title":"Mathematics"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Webster, A.F., Tavares, S.E.: On the design of s-boxes. In: Williams, H.C. (eds.) Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings. CRYPTO 1985. LNCS, vol. 218, pp. 523\u2013534. Springer, Berlin, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_41","DOI":"10.1007\/3-540-39799-X_41"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"7668","DOI":"10.3390\/app10217668","volume":"10","author":"EJ Madarro-Cap\u00f3","year":"2020","unstructured":"Madarro-Cap\u00f3, E.J., Leg\u00f3n-P\u00e9rez, C.M., Rojas, O., Sosa-G\u00f3mez, G., Socorro-Llanes, R.: Bit independence criterion extended to stream ciphers. Appl. Sci. 10, 7668 (2020). https:\/\/doi.org\/10.3390\/app10217668","journal-title":"Appl. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Sakalauskas, E., Luksys, K.: The matrix power function and its application to block cipher S-Box construction. Int. J. Innov. Comput. Inf. Control 8 (2012)","DOI":"10.5755\/j01.itc.41.4.820"},{"key":"2_CR11","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, 517\u2013524 (2017)","journal-title":"Informatica"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Mihalkovich, A.: On the associativity property of MPF over M16. Liet. Mat. Rink. Liet. Mat. Draugijos Darb. Ser. A 59, 7\u201312 (2018). https:\/\/doi.org\/10.15388\/LMR.A.2018.02","DOI":"10.15388\/LMR.A.2018.02"},{"key":"2_CR13","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, 2631\u20132640 (1996). https:\/\/doi.org\/10.1090\/S0002-9939-96-03345-X","journal-title":"Proc. Am. Math. Soc."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"244","DOI":"10.2478\/s11533-009-0072-x","volume":"8","author":"HG Grundman","year":"2010","unstructured":"Grundman, H.G., Smith, T.L.: Realizability and automatic realizability of Galois groups of order 32. Cent. Eur. J. Math. 8, 244\u2013260 (2010). https:\/\/doi.org\/10.2478\/s11533-009-0072-x","journal-title":"Cent. Eur. J. Math."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2478\/s11533-010-0052-1","volume":"8","author":"HG Grundman","year":"2010","unstructured":"Grundman, H.G., Smith, T.L.: Galois realizability of groups of order 64. Cent. Eur. J. Math. 8, 846\u2013854 (2010). https:\/\/doi.org\/10.2478\/s11533-010-0052-1","journal-title":"Cent. Eur. J. Math."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.21595\/mme.2021.22234","volume":"7","author":"M Levinskas","year":"2021","unstructured":"Levinskas, M., Michalkovi\u010d, A.: Avalanche effect and bit independence criterion of perfectly secure Shannon cipher based on matrix power. Math. Models Eng. 7, 50\u201353 (2021)","journal-title":"Math. Models Eng."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.21595\/mme.2022.22517","volume":"8","author":"A Mihalkovich","year":"2022","unstructured":"Mihalkovich, A., Levinskas, M., Makauskas, P.: MPF based symmetric cipher performance comparison to AES and TDES. Math. Models Eng. 8, 15\u201325 (2022)","journal-title":"Math. Models Eng."},{"key":"2_CR18","unstructured":"Computer Security Division, I.T.L. Update to Current Use and Deprecation of TDEA | CSRC. https:\/\/csrc.nist.gov\/News\/2017\/Update-to-Current-Use-and-Deprecation-of-TDEA. Accessed 27 Feb 2023"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48981-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T11:03:35Z","timestamp":1704798215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48981-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031489808","9783031489815"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48981-5_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"10 January 2024","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":"Kaunas","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icist2023","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":"75","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":"27","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":"36% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}