{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:36:38Z","timestamp":1757777798506,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602383"},{"type":"electronic","value":"9783030602390"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-60239-0_25","type":"book-chapter","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T09:03:14Z","timestamp":1601370194000},"page":"365-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Computation of the Exact Number of Magic Series with an Improved Montgomery Multiplication Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7349-1491","authenticated-orcid":false,"given":"Yukimasa","family":"Sugizaki","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1357-5770","authenticated-orcid":false,"given":"Daisuke","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0315-0860(79)90074-0","volume":"6","author":"NL Biggs","year":"1979","unstructured":"Biggs, N.L.: The roots of combinatorics. Historia Math. 6(2), 109\u2013136 (1979). \nhttps:\/\/doi.org\/10.1016\/0315-0860(79)90074-0","journal-title":"Historia Math."},{"issue":"8","key":"25_CR2","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1016\/j.laa.2012.05.031","volume":"437","author":"RP Nordgren","year":"2012","unstructured":"Nordgren, R.P.: On properties of special magic square matrices. Linear Algebra Appl. 437(8), 2009\u20132025 (2012). \nhttps:\/\/doi.org\/10.1016\/j.laa.2012.05.031","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2307\/595587","volume":"80","author":"S Cammann","year":"1960","unstructured":"Cammann, S.: The evolution of magic squares in China. J. Am. Orient. Soc. 80(2), 116\u2013124 (1960). \nhttps:\/\/doi.org\/10.2307\/595587","journal-title":"J. Am. Orient. Soc."},{"issue":"15","key":"25_CR4","doi-asserted-by":"publisher","first-page":"3393","DOI":"10.1016\/j.disc.2007.06.022","volume":"308","author":"G Xin","year":"2008","unstructured":"Xin, G.: Constructing all magic squares of order three. Discrete Math. 308(15), 3393\u20133398 (2008). \nhttps:\/\/doi.org\/10.1016\/j.disc.2007.06.022","journal-title":"Discrete Math."},{"key":"25_CR5","unstructured":"Beeler, M.: Appendix 5: The Order 5 Magic Squares (1973). (Privately Published)"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1142\/S0129183198000443","volume":"9","author":"K Pinn","year":"1998","unstructured":"Pinn, K., Wieczerkowski, C.: Number of magic squares from parallel tempering Monte Carlo. Int. J. Mod. Phys. C 9(4), 541\u2013546 (1998). \nhttps:\/\/doi.org\/10.1142\/S0129183198000443","journal-title":"Int. J. Mod. Phys. C"},{"key":"25_CR7","unstructured":"Trump, W.: Magic Series. \nhttp:\/\/www.trump.de\/magic-squares\/magic-series"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1090\/S0025-5718-10-02347-1","volume":"80","author":"M Beck","year":"2011","unstructured":"Beck, M., van Herick, A.: Enumeration of $$4 \\times 4$$ magic squares. Math. Comput. 80, 617\u2013621 (2011). \nhttps:\/\/doi.org\/10.1090\/S0025-5718-10-02347-1","journal-title":"Math. Comput."},{"key":"25_CR9","unstructured":"Ripatti, A.: On the number of semi-magic squares of order 6 (2018). \narXiv: 1807.02983"},{"key":"25_CR10","unstructured":"Kato, G., Minato, S.: Enumeration of associative magic squares of order 7 (2019). \narXiv: 1906.07461"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1080\/0025570X.2000.11996804","volume":"73","author":"C Libis","year":"2000","unstructured":"Libis, C., Phillips, J.D., Spall, M.: How many magic squares are there? Math. Mag. 73(1), 57\u201358 (2000). \nhttps:\/\/doi.org\/10.1080\/0025570X.2000.11996804","journal-title":"Math. Mag."},{"key":"25_CR12","unstructured":"Kraitchik, M.: Mathematical Recreations, 2nd revised edn. Dover Publications (2006)"},{"key":"25_CR13","unstructured":"Bottomley, H.: Partition and composition calculator. \nhttp:\/\/www.se16.info\/js\/partitions.htm"},{"key":"25_CR14","unstructured":"Gerbicz, R.: Robert Gerbicz\u2019s Home Page. \nhttps:\/\/sites.google.com\/site\/robertgerbicz"},{"key":"25_CR15","unstructured":"Kinnaes, D.: Calculating exact values of $$N(x, m)$$ without using recurrence relations (2013). \nhttp:\/\/www.trump.de\/magic-squares\/magic-series\/kinnaes-algorithm.pdf"},{"key":"25_CR16","unstructured":"Endo, K.: Private Communication (2019)"},{"key":"25_CR17","unstructured":"Quist, M.: Asymptotic enumeration of magic series (2013). \narXiv: 1306.0616"},{"key":"25_CR18","unstructured":"Kinnaes, D.: Private Communication (2019)"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985). \nhttps:\/\/doi.org\/10.1090\/S0025-5718-1985-0777282-X","journal-title":"Math. Comput."},{"key":"25_CR20","unstructured":"Intel Corporation: Intel 64 and IA-32 Architectures Software Developer\u2019s Manual. \nhttps:\/\/software.intel.com\/en-us\/articles\/intel-sdm"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7K Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996). \nhttps:\/\/doi.org\/10.1109\/40.502403","journal-title":"IEEE Micro"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-43414-7_24","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Montgomery, P.L., Shumow, D., Zaverucha, G.M.: Montgomery multiplication using vector instructions. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 471\u2013489. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43414-7_24"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2018.02.002","volume":"75","author":"D Takahashi","year":"2018","unstructured":"Takahashi, D.: Computation of the $$100$$ quadrillionth hexadecimal digit of $$\\pi $$ on a cluster of Intel Xeon Phi processors. Parallel Comput. 75, 1\u201310 (2018). \nhttps:\/\/doi.org\/10.1016\/j.parco.2018.02.002","journal-title":"Parallel Comput."},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Duss\u00e9, S.R., Kaliski Jr., B.S.: A cryptographic library for the Motorola DSP56000. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 230\u2013244. Springer, Heidelberg (1991). \nhttps:\/\/doi.org\/10.1007\/3-540-46877-3_21","DOI":"10.1007\/3-540-46877-3_21"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48059-5_9","volume-title":"Cryptographic Hardware and Embedded Systems","author":"CD Walter","year":"1999","unstructured":"Walter, C.D.: Montgomery\u2019s multiplication technique: how to make it smaller and faster. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 80\u201393. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48059-5_9"},{"key":"25_CR26","unstructured":"OpenMP Architecture Review Boards: OpenMP. \nhttps:\/\/www.openmp.org"},{"issue":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1969454","volume":"50","author":"A Selberg","year":"1949","unstructured":"Selberg, A.: An elementary proof of Dirichlet\u2019s theorem about primes in an arithmetic progression. Ann. Math. 50(2), 297\u2013304 (1949). \nhttps:\/\/doi.org\/10.2307\/1969454","journal-title":"Ann. Math."},{"key":"25_CR28","unstructured":"Trump, W.: Private Communication (2019)"},{"issue":"4","key":"25_CR29","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s11155-005-6891-y","volume":"11","author":"N Revol","year":"2005","unstructured":"Revol, N., Rouillier, F.: Motivations for an arbitrary precision interval arithmetic and the MPFI library. Reliable Comput. 11(4), 275\u2013290 (2005). \nhttps:\/\/doi.org\/10.1007\/s11155-005-6891-y","journal-title":"Reliable Comput."},{"key":"25_CR30","unstructured":"Adams, W.W., Goldstein, L.J.: Introduction to Number Theory. Prentice-Hall (1976)"},{"key":"25_CR31","doi-asserted-by":"publisher","unstructured":"Childs, L.N.: A Concrete Introduction to Higher Algebra, 3rd edn. Springer, New York (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-74725-5","DOI":"10.1007\/978-0-387-74725-5"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60239-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T09:36:26Z","timestamp":1601372186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60239-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602383","9783030602390"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60239-0_25","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":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cloud-conf.net\/ica3pp2020\/","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":"495","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":"142","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":"5","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":"29% - 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":"305","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":"10","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)"}}]}}