{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T17:02:51Z","timestamp":1726074171218},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_5","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"49-57","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Modular Squaring in Binary Fields on CPU Supporting AVX and GPU"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Augustynowicz","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Paszkiewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Augustynowicz, P., Paszkiewicz, A.: Empirical verification of a hypothesis on the inner degree of sedimentary irreducible polynomials over $$GF(2)$$. Przegl\u0105d Telekomunikacyjny + Wiadomo\u015bci Telekomunikacyjne 8\u20139, 799\u2013802 (2017). \nhttps:\/\/doi.org\/10.15199\/59.2017.8-9.33","key":"5_CR1","DOI":"10.15199\/59.2017.8-9.33"},{"doi-asserted-by":"publisher","unstructured":"Augustynowicz, P., Paszkiewicz, A.: On trinomials irreducible over $$GF(2)$$ accompanying to the polynomials of the form $$x^{2\\cdot 3^l}+x^{3^l}+1$$. Przegl\u0105d Telekomunikacyjny + Wiadomo\u015bci Telekomunikacyjne 8\u20139 (2018). \nhttps:\/\/doi.org\/10.15199\/59.2018.8-9.48","key":"5_CR2","DOI":"10.15199\/59.2018.8-9.48"},{"doi-asserted-by":"publisher","unstructured":"Ben-Or, M.: Probabilistic algorithms in finite fields. In: 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp. 394\u2013398, October 1981. \nhttps:\/\/doi.org\/10.1109\/SFCS.1981.37","key":"5_CR3","DOI":"10.1109\/SFCS.1981.37"},{"doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Hamilis, M., Silberstein, M., Tromer, E.: Fast multiplication in binary fields on GPUs via register cache. In: Proceedings of the 2016 International Conference on Supercomputing, ICS 2016, pp. 35:1\u201335:12, Istanbul, Turkey (2016). \nhttps:\/\/doi.org\/10.1145\/2925426.2926259\n\n, ISBN 978-1-4503-4361-9","key":"5_CR4","DOI":"10.1145\/2925426.2926259"},{"unstructured":"Cohen, H., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2nd edn. Chapman & Hall\/CRC (2012). ISBN 9781439840009","key":"5_CR5"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-40820-5_13","volume-title":"Network and Parallel Computing","author":"K Feng","year":"2013","unstructured":"Feng, K., Ma, W., Huang, W., Zhang, Q., Gong, Y.: Speeding up Galois field arithmetic on Intel MIC architecture. In: Hsu, C.-H., Li, X., Shi, X., Zheng, R. (eds.) NPC 2013. LNCS, vol. 8147, pp. 143\u2013154. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40820-5_13"},{"doi-asserted-by":"publisher","unstructured":"Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. 21(9), 948\u2013960 (1972). \nhttps:\/\/doi.org\/10.1109\/TC.1972.5009071\n\n, ISSN 0018\u20139340","key":"5_CR7","DOI":"10.1109\/TC.1972.5009071"},{"doi-asserted-by":"publisher","unstructured":"Kalcher, S., Lindenstruth, V.: Accelerating Galois field arithmetic for Reed-Solomon erasure codes in storage applications. In: 2011 IEEE International Conference on Cluster Computing, pp. 290\u2013298, September 2011. \nhttps:\/\/doi.org\/10.1109\/CLUSTER.2011.40","key":"5_CR8","DOI":"10.1109\/CLUSTER.2011.40"},{"key":"5_CR9","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1986","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, New York (1986)"},{"unstructured":"Lidl, R., et al.: Finite Fields. EBL-Schweitzer t. 20, pkt 1. Cambridge University Press (1997). \nhttps:\/\/books.google.pl\/books?id=xqMqxQTFUkMC\n\n, ISBN 9780521392310","key":"5_CR10"},{"unstructured":"Plank, J.S., Greenan, K.M., Miller, E.L.: Screaming fast Galois field arithmetic using intel SIMD instructions. In: Proceedings of the 11th USENIX Conference on File and Storage Technologies, FAST 2013, San Jose, CA, USA, 12\u201315 February 2013, pp. 299\u2013306 (2013). \nhttps:\/\/www.usenix.org\/conference\/fast13\/technicalsessions\/presentation\/plank%5C_james%5C_simd","key":"5_CR11"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"MO Rabin","year":"1979","unstructured":"Rabin, M.O.: Probabilistic algorithms in finite fields. SIAM J. Comput. 9, 273\u2013280 (1979)","journal-title":"SIAM J. Comput."},{"unstructured":"Shoup,V.: NTL: A library for doing number theory (2003). \nhttp:\/\/www.shoup.net\/ntl","key":"5_CR13"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:07:34Z","timestamp":1584576454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"161","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":"91","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":"57% - 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,5","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)"}}]}}