{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:55:27Z","timestamp":1761580527763},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425212"},{"type":"electronic","value":"9783540447092"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_17","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:04:18Z","timestamp":1186841058000},"page":"185-201","source":"Crossref","is-referenced-by-count":35,"title":["High-Radix Design of a Scalable Modular Multiplier"],"prefix":"10.1007","author":[{"given":"Alexandre F.","family":"Tenca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgi","family":"Todorov","sequence":"additional","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":[[2001,9,20]]},"reference":[{"key":"17_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":"17_CR2","first-page":"70","volume-title":"Proceedings, 14th Symposium on Computer Arithmetic","author":"T. Blum","year":"1999","unstructured":"T. Blum and C. Paar. Montgomery modular exponentiation on reconfigurable hardware. In I. Koren and P. Kornerup, editors, Proceedings, 14th Symposium on Computer Arithmetic, pages 70\u201377, Bath, England, April 14\u201316 1999. IEEE Computer Society Press, Los Alamitos, CA."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A. D. Booth","year":"1951","unstructured":"A. D. Booth. A signed binary multiplication technique. Q. J. Mech. Appl. Math., 4(2):236\u2013240, 1951. (Also reprinted in [17], pp. 100\u2013104).","journal-title":"Q. J. Mech. Appl. Math."},{"key":"17_CR4","unstructured":"Mentor Graphics Corporation. ASIC Design Kit. \n                    http:\/\/www.mentor.com\/partners\/hep\/AsicDesignKit\/ASICindex.html\n                    \n                  , 2001."},{"key":"17_CR5","doi-asserted-by":"crossref","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"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203\u2013209, January 1987.","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"\u00c7. K. Ko\u00e7, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26\u201333, June 1996.","DOI":"10.1109\/40.502403"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/ARITH.1993.378082","volume-title":"Proceedings, 11th Symposium on Computer Arithmetic","author":"P. Kornerup","year":"1993","unstructured":"P. Kornerup. High-radix modular multiplication for cryptosystems. In E. Swartzlander, Jr., M. J. Irwin, and G. Jullien, editors, Proceedings, 11th Symposium on Computer Arithmetic, pages 277\u2013283, Windsor, Ontario, June 29\u2013July 2 1993. IEEE Computer Society Press, Los Alamitos, CA."},{"key":"17_CR9","volume-title":"Applications of Finite Fields","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes, I. F. Blake, X. Gao, R. C. Mullen, S. A. Vanstone, and T. Yaghoobian. Applications of Finite Fields. Kluwer Academic Publishers, Boston, MA, 1993."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519\u2013521, April 1985.","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"D. Naccache and D. M\u2019Ra\u00efhi. Cryptographic smart cards. IEEE Micro, 16(3):14\u201324, June 1996.","DOI":"10.1109\/40.502402"},{"key":"17_CR12","first-page":"169","volume":"56","author":"National Institute for Standards and Technology","year":"1991","unstructured":"National Institute for Standards and Technology. Digital signature standard (DSS). Federal Register, 56:169, August 1991.","journal-title":"Federal Register"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/ARITH.1995.465359","volume-title":"Proceedings, 12th Symposium on Computer Arithmetic","author":"H. Orup","year":"1995","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. IEEE Computer Society Press, Los Alamitos, CA."},{"issue":"2","key":"17_CR14","doi-asserted-by":"crossref","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":"17_CR15","series-title":"Lect Notes Comput Sci","first-page":"281","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2000","author":"E. Sava\u015f","year":"2000","unstructured":"E. Sava\u015f, A. F. Tenca, and \u00c7. K. Ko\u00e7. A scalable and unified multiplier architecture for finite fields gf(p) and gf(2m). In \u00c7. K. Ko\u00e7 and C. Paar, editors, Cryptographic Hardware and Embedded Systems-CHES 2000, Lecture Notes in Computer Science No. 1965, pages 281\u2013296. Springer, Berlin, Germany, 2000."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/ARITH.1997.614873","volume-title":"Proceedings, 13th Symposium on Computer Arithmetic","author":"E. M. Schwarz","year":"1997","unstructured":"E. M. Schwarz, R. M. Averil III, and L. J. Sigal. A radix-8 CMOS S\/390 multiplier. In T. Lang, J.-M. Muller, and N. Takagi, editors, Proceedings, 13th Symposium on Computer Arithmetic, pages 2\u20139, Bath, England, July 6\u20139 1997. IEEE Computer Society Press, Los Alamitos, CA."},{"volume-title":"Computer Arithmetic","year":"1990","key":"17_CR17","unstructured":"E. E. Swartzlander, editor. Computer Arithmetic, volume I. IEEE Computer Society Press, Los Alamitos, CA, 1990."},{"key":"17_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","volume-title":"Cryptographic Hardware and Embedded Systems","author":"A. F. Tenca","year":"1999","unstructured":"A. F. Tenca and \u00c7. K. Ko\u00e7. A scalable architecture for Montgomery multiplication. In \u00c7. K. Ko\u00e7 and C. Paar, editors, Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science No. 1717, pages 94\u2013108. Springer, Berlin, Germany, 1999."},{"key":"17_CR19","unstructured":"G. Todorov. Asic design, implementation and analysis of a scalable high-radix montgomery multiplier. Master\u2019s thesis, Department of Electrical and Computer Engineering, Oregon State University, December 2000."},{"issue":"1","key":"17_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/92.820767","volume":"8","author":"W. C. Tsai","year":"2000","unstructured":"W. C. Tsai, C. B. Shung, and S. J. Wang. Two systolic architectures for Montgomery multiplication. IEEE Transactions on VLSI Systems, 8(1):103\u2013107, February 2000.","journal-title":"IEEE Transactions on VLSI Systems"},{"issue":"2","key":"17_CR21","doi-asserted-by":"crossref","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 \u2014 CHES 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44709-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:02:48Z","timestamp":1550772168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}