{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:40:36Z","timestamp":1743036036094,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":9,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048197934"},{"type":"electronic","value":"9789048197941"}],"license":[{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"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":[[2011]]},"DOI":"10.1007\/978-90-481-9794-1_75","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T21:21:08Z","timestamp":1284758468000},"page":"405-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields"],"prefix":"10.1007","author":[{"given":"Sedat","family":"Akleylek","sequence":"first","affiliation":[]},{"given":"Murat","family":"Cenk","sequence":"additional","affiliation":[]},{"given":"Ferruh","family":"\u00d6zbudak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,18]]},"reference":[{"key":"75_CR1_75","unstructured":"H. Cohen and G. Frey, Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and Its Applications 34, ChapmanHall\/CRC, 2005."},{"key":"75_CR2_75","unstructured":"D. Hankerson, A. Menezes and S. Vanstone, Guide to Elliptic Curve Cryptography, Springer, 2004."},{"key":"75_CR3_75","doi-asserted-by":"crossref","unstructured":"M. Knezevic, L. Batina and I. Verbauwhede, Modular Reduction without Precomputational Phase, IEEE International Symposium on Circuits and Systems (ISCAS 2009), IEEE, 4 pages, 2009.","DOI":"10.1109\/ISCAS.2009.5118024"},{"key":"75_CR4_75","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-69499-1_7","volume":"5130","author":"M. Knezevic","year":"2008","unstructured":"M. Knezevic, J. Fan, K. Sakiyama, and I. Verbauwhede, Modular Reduction in GF(2n) without Pre-Computational Phase, International Workshop on the Arithmetic of Finite Fields (WAIFI 2008), LNCS 5130, pp. 77\u201387, 2008.","journal-title":"International Workshop on the Arithmetic of Finite Fields (WAIFI 2008), LNCS"},{"key":"75_CR5_75","doi-asserted-by":"crossref","unstructured":"M. Knezevic, F. Vercauteren, and I. Verbauwhede, Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods, COSIC internal report, 8 pages, 2009.","DOI":"10.1109\/TC.2010.93"},{"key":"75_CR6_75","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7.K. Ko\u00e7","year":"1998","unstructured":"\u00c7.K. Ko\u00e7 and T. Acar, Montgomery Multiplication in GF(2k), Designs, Codes and Cryptography, vol. 14, pp. 57\u201369, 1998.","journal-title":"Designs, Codes and Cryptography"},{"key":"75_CR7_75","doi-asserted-by":"crossref","unstructured":"R.Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University, 1997.","DOI":"10.1017\/CBO9780511525926"},{"key":"75_CR8_75","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"P. Montgomery, Modular multiplication without trial division, in Mathematics of Computation, vol. 44, pp. 519\u2013521, April 1985.","journal-title":"Mathematics of Computation"},{"key":"75_CR9_75","doi-asserted-by":"crossref","unstructured":"G. Mullen and C. Mummert, Finite Fields and Applications, American Mathematical Society, 2007.","DOI":"10.1090\/stml\/041"}],"container-title":["Lecture Notes in Electrical Engineering","Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-9794-1_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:21:58Z","timestamp":1675902118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-9794-1_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,18]]},"ISBN":["9789048197934","9789048197941"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-9794-1_75","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2010,8,18]]},"assertion":[{"value":"18 August 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}