{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T10:17:14Z","timestamp":1779185834996,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540666462","type":"print"},{"value":"9783540480594","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48059-5_10","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T18:18:49Z","timestamp":1195237129000},"page":"94-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":93,"title":["A Scalable Architecture for Montgomery Nultiplication"],"prefix":"10.1007","author":[{"given":"Alexandre F.","family":"Tenca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin K.","family":"Ko\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"10_CR1","unstructured":"A. Bernal and A. Guyot. Design of a modular multiplier based on Montgomery\u2019s algorithm. In 13th Conference on Design of Circuits and Integrated Systems, pages 680\u2013685, Madrid, Spain, November 17\u201320 1998."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644\u2013654, November 1976.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/12.277287","volume":"42","author":"S. E. Eldridge","year":"1993","unstructured":"S. E. Eldridge and C. D. Walter. Hardware implementation of Montgomery\u2019s modular multiplication algorithm. IEEE Transactions on Computers, 42(6):693\u2013699, June 1993.","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"T. Hamano, N. Takagi, S. Yajima, and F. P Preparata. O(n)-Depth circuit algorithm for modular exponentiation. In S. Knowles and W. H. McAllister, editors, Proceedings, 12th Symposium on Computer Arithmetic, pages 188\u2013192, Bath, England, July 19\u201321 1995. Los Alamitos, CA: IEEE Computer Society Press.","DOI":"10.1109\/ARITH.1995.465360"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"\u00c7. K. Ko\u00c7 and T. Acar. Fast software exponentiation in GF(2k). In T. Lang, J.-M. Muller, and N. Takagi, editors, Proceedings, 13th Symposium on Computer Arithmetic, pages 225\u2013231, Asilomar, California, July 6\u20139, 1997. Los Alamitos, CA: IEEE Computer Society Press.","DOI":"10.1109\/ARITH.1997.614899"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7. K. K. Ko\u00c7","year":"1998","unstructured":"\u00c7. K. Ko\u00c7 and T. Acar. Montgomery multiplication in GF(2k). Designs, Codes and Cryptography, 14(1):57\u201369, April 1998.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7. K. K. Ko\u00c7","year":"1996","unstructured":"\u00c7. K. Ko\u00c7, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26\u201333, June 1996.","journal-title":"IEEE Micro"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"P. Kornerup. High-radix modular multiplication for cryptosystems. In E. Swartz lander, Jr., M. J. Irwin, and G. Jullien, editors, Proceedings, 11th Symposium on Computer Arithmetic, pages 277\u2013283, Windsor, Ontario, June 29-July 2 1993. Los Alamitos, CA: IEEE Computer Society Press.","DOI":"10.1109\/ARITH.1993.378082"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key Cryptosystems","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Boston, MA: Kluwer Academic Publishers, 1993."},{"issue":"170","key":"10_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519\u2013521, April 1985.","journal-title":"Mathematics of Computation"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"H. Orup. Simplifying quotient determination in high-radix modular multiplication. In S. Knowles and W. H. McAllister, editors, Proceedings, 12th Symposium on Computer Arithmetic, pages 193\u2013199, Bath, England, July 19\u201321 1995. Los Alamitos, CA: IEEE Computer Society Press.","DOI":"10.1109\/ARITH.1995.465359"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120\u2013126, February 1978.","journal-title":"Communications of the ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"A. Royo, J. Moran, and J. C. Lopez. Design and implementation of a coprocessor for cryptography applications. In European Design and Test Conference, pages 213\u2013217, Paris, France, March 17\u201320 1997.","DOI":"10.1109\/EDTC.1997.582361"},{"key":"10_CR14","series-title":"PhD thesis","volume-title":"Variable Long-Precision Arithmetic (VLPA) for Reconfigurable Co-processor Architectures","author":"A. F. Tenca","year":"1998","unstructured":"A. F. Tenca. Variable Long-Precision Arithmetic (VLPA) for Reconfigurable Co-processor Architectures. PhD thesis, Department of Computer Science, University of California at Los Angeles, March 1998."},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/12.565588","volume":"46","author":"C. D. Walter","year":"1997","unstructured":"C. D. Walter. Space\/Time trade-offs for higher radix modular multiplication using repeated addition. IEEE Transactions on Computers, 46(2):139\u2013141, February 1997.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48059-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T13:42:34Z","timestamp":1737553354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48059-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666462","9783540480594"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48059-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"8 February 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}