{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:24:01Z","timestamp":1742394241722},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414551"},{"type":"electronic","value":"9783540444992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44499-8_22","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:14:13Z","timestamp":1188310453000},"page":"277-292","source":"Crossref","is-referenced-by-count":41,"title":["A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)"],"prefix":"10.1007","author":[{"given":"Erkay","family":"Sava\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre F.","family":"Tenca","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":[[2002,1,29]]},"reference":[{"issue":"5","key":"22_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G. B. Agnew","year":"1993","unstructured":"G. B. Agnew, R. C. Mullin, and S. A. Vanstone. An implementation of elliptic curve cryptosystems over F2155. IEEE Journal on Selected Areas in Communications, 11(5):804\u2013813, June 1993.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"22_CR2","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-20 1998."},{"key":"22_CR3","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"},{"issue":"6","key":"22_CR4","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":"22_CR5","unstructured":"Steve Furber. ARM System Architecture. Addison-Wesley, Reading, MA, 1997."},{"issue":"8","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B. S. Kaliski Jr","year":"1995","unstructured":"B. S. Kaliski Jr. The Montgomery inverse and its applications. IEEE Transactions on Computers, 44(8):1064\u20131065, August 1995.","journal-title":"IEEE Transactions on Computers"},{"issue":"177","key":"22_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203\u2013209, January 1987.","journal-title":"Mathematics of Computation"},{"key":"22_CR8","unstructured":"\u00c7. K. Ko\u00e7. High-Speed RSA Implementation. Technical Report TR 201, RSA Laboratories, 73 pages, November 1994."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7. K. K. Ko\u00e7","year":"1998","unstructured":"\u00c7. K. Ko\u00e7 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":"22_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7. K. K. Ko\u00e7","year":"1996","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.","journal-title":"IEEE Micro"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"P. Kornerup. High-radix modular multiplication for cryptosystems. In E. Swartzlander, M. J. Irwin, and G. Jullien, editors, Proceedings, 11th Symposium on Computer Arithmetic, pages 277\u2013283, Windsor, Ontario, June 29-July 2 1993. IEEE Computer Society Press, Los Alamito","DOI":"10.1109\/ARITH.1993.378082"},{"key":"22_CR12","doi-asserted-by":"crossref","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. Kluwer Academic Publishers, Boston, MA, 1993."},{"issue":"170","key":"22_CR13","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","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":"22_CR14","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":"22_CR15","unstructured":"National Institute for Standards and Technology. Digital Signature Standard (DSS). FIPS PUB 186-2, January 2000."},{"key":"22_CR16","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-21 1995. IEEE Computer Society Press, Los Alamitos, CA.","DOI":"10.1109\/ARITH.1995.465359"},{"issue":"21","key":"22_CR17","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA publickey cryptosystem. Electronics Letters, 18(21):905\u2013907, October 1982.","journal-title":"Electronics Letters"},{"key":"22_CR18","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-20 1997.","DOI":"10.1109\/EDTC.1997.582361"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"E. Sava\u00a7 and \u00c7. K. Ko\u00e7. The Montgomery modular inverse-revisited. IEEE Transactions on Computers, 49(8), July 2000. To appear.","DOI":"10.1109\/12.863048"},{"key":"22_CR20","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."},{"issue":"2","key":"22_CR21","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 \u2014 CHES 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44499-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:07:08Z","timestamp":1556816828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44499-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414551","9783540444992"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44499-8_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}