{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:42Z","timestamp":1725566142272},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229896"},{"type":"electronic","value":"9783540301172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30117-2_25","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T05:01:02Z","timestamp":1284786062000},"page":"231-240","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Modular Division Implementation"],"prefix":"10.1007","author":[{"given":"Guerric Meurice","family":"de Dormale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Bulens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Brent, R.P., Kung, H.T.: Systolic VLSI arrays for linear time GCD computation. In: VLSI 1983, pp. 145\u2013154 (1983)"},{"key":"25_CR2","unstructured":"Chang-Shantz, S.: From Euclid\u2019s GCD to Montgomery Multiplication to the Great Divide. Technical report, Sun Microsystems Laboratories TR-2001-95 (June 2001)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation using Mixed Coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45234-8_76","volume-title":"Field Programmable Logic and Application","author":"A. Daly","year":"2003","unstructured":"Daly, A., Marnane, W., Kerins, T., Popovici, E.: Fast Modular Division for Application in ECC on Reconfigurable Logic. In: Y. K. Cheung, P., Constantinides, G.A. (eds.) FPL 2003. LNCS, vol.\u00a02778, Springer, Heidelberg (2003)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Daly, A., Marnane, W.: Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic. In: Proceedings of the 2002 ACM\/SIGDA tenth international symposium on Fieldprogrammable gate arrays (2002)","DOI":"10.1145\/503048.503055"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45238-6_20","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"M. Joye","year":"2003","unstructured":"Joye, M., Paillier, P.: GCD-free Algorithms for Computing Modular Inverses. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 243\u2013253. Springer, Heidelberg (2003)"},{"key":"25_CR7","unstructured":"Kahaira, M.E., Takagi, N.: A VLSI Algorithm for Modular Mulitplication\/Division. In: The 16th IEEE Symposium on Computer Arithmetic \u2014 ARITH 16, Spain, Santiago de Compostela, June 15-18 (2003)"},{"issue":"8","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B.S. Kaliski Jr.","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery Inverse and its Applications. IEEE Transactions on Computers\u00a044(8), 1064\u20131065 (1995)","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR9","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Seminumerical Algorithms. Addison-Wesley, Reading (1981)","edition":"2"},{"issue":"7","key":"25_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1109\/12.863048","volume":"49","author":"E. Sava\u015f","year":"2000","unstructured":"Sava\u015f, E., Ko\u00e7, \u00c7.K.: The Montgomery Modular Inverse - Revisited. IEEE Transactions on Computers\u00a049(7), 763\u2013766 (2000)","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"25_CR11","first-page":"724","volume":"E81-A","author":"N. Takagi","year":"1998","unstructured":"Takagi, N.: A VLSI Algorithm for Modular Division Based on the Binary GCD Algorithm. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences\u00a0E81-A(5), 724\u2013728 (1998)","journal-title":"IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences"}],"container-title":["Lecture Notes in Computer Science","Field Programmable Logic and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30117-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T17:47:16Z","timestamp":1547747236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30117-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229896","9783540301172"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30117-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}