{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:46Z","timestamp":1759146946294,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2003.1213341","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"8","source":"Crossref","is-referenced-by-count":26,"title":["Hardware implementation of a Montgomery modular multiplier in a systolic array"],"prefix":"10.1109","author":[{"given":"S.B.","family":"Ors","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Batina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Preneel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Vandewalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"945","article-title":"Techniques for the hardware implementation of modular multiplication","volume":"2","author":"walter","year":"1998","journal-title":"Proceedings of 2nd IMACS International Conference on Circuits Systems & Computers"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/el:19950217"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/12.210181"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/92.820767"},{"key":"ref37","first-page":"30","article-title":"Precise bounds for Montgomery modular multiplication and some potentially insecure RSA moduli","author":"walter","year":"2002","journal-title":"Proceedings of Topics in Cryptology-CTRSA 2002 number 2271 in Lecture Notes in Computer Science"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20000638"},{"key":"ref35","first-page":"80","article-title":"Montgomery's multiplication technique: How to make it smaller and faster","author":"walter","year":"1999","journal-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999) number 1717 in Lecture Notes in Computer Science"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1049\/el:19991230"},{"key":"ref10","first-page":"477","article-title":"Systolic-arrays for modular exponentiation using Montgomery method","author":"iwamura","year":"1992","journal-title":"Advances in Cryptology Proceedings of EUROCRYPT'92 number 658 in Lecture Notes in Computer Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430770304"},{"key":"ref12","article-title":"Implementation of 1024-bit modular processor for RSA cryptosystem","author":"kim","year":"2000","journal-title":"Proceedings of Asia-Pasific Conference on ASIC (AP-ASIC)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/12.295851"},{"journal-title":"Logic and Computer Design Fundamentals","year":"2001","author":"mano","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/el:19980286"},{"journal-title":"Handbook of Applied Cryptography","year":"1997","author":"menezes","key":"ref17"},{"key":"ref18","first-page":"417","article-title":"Uses of elliptic curves in cryptography","author":"miller","year":"1985","journal-title":"Advances in Cryptology Proceedings of CRYPTO’85 number 218 in Lecture Notes in Computer Science"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1049\/el:19980624","article-title":"systolic modular exponentiation via montgomery algorithm","volume":"34","author":"tiountchik","year":"1998","journal-title":"Electronics Letters"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/12.936241"},{"key":"ref27","first-page":"189","article-title":"High-radix design of a scalable modular multiplier","author":"tenca","year":"2001","journal-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2001) number 2162 in Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762831"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.277287"},{"key":"ref29","first-page":"235","article-title":"Scalable algorithm for Montgomery multiplication and its implementation on the coarsegrain reconfigurable chip","author":"trichina","year":"2001","journal-title":"Proceedings of Topics in Cryptology - CT-RSA 2001 number 2020 in Lecture Notes in Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2000.862386"},{"key":"ref7","first-page":"619","article-title":"Systolic modular multiplication","author":"even","year":"1990","journal-title":"Advances in Cryptology Proceedings of CRYPTO'90 number 537 in Lecture Notes in Computer Science"},{"key":"ref2","article-title":"Hardware architectures for public key cryptography","author":"batina","year":"2002","journal-title":"Elsevier Science Integration the VLSI Journal"},{"key":"ref9","first-page":"221","article-title":"High-speed implementation methods for RSA scheme","author":"iwamura","year":"1992","journal-title":"Advances in Cryptology Proceedings of EU-ROCRYPT'92 number 658 in Lecture Notes in Computer Science"},{"key":"ref1","first-page":"40","article-title":"Montgomery in practice: How to do it more efficiently in hardware","author":"batina","year":"2002","journal-title":"Proceedings of RSA 2002 Cryptographers' Track number 2271 in Lecture Notes in Computer Science"},{"journal-title":"Hardware implementation of an elliptic curve processor over GF (p)","year":"2002","author":"ors","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055261"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1995.465359"},{"key":"ref24","first-page":"281","article-title":"A scalable and unified multiplier architecture for finite fields GF(p) and GF (2m)","author":"savas","year":"2000","journal-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 2000) number 1965 in Lecture Notes in Computer Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref26","first-page":"94","article-title":"A scalable architecture for Montgomery multiplication","author":"tenca","year":"1999","journal-title":"Proceedings of Cryptographic Hardware and Embedded Systems (CHES 1999) number 1717 in Lecture Notes in Computer Science"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/92.766756","article-title":"An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem","volume":"7","author":"su","year":"1999","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"}],"event":{"name":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","acronym":"IPDPS-03","location":"Nice, France"},"container-title":["Proceedings International Parallel and Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8608\/27277\/01213341.pdf?arnumber=1213341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:04Z","timestamp":1497572764000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1213341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2003.1213341","relation":{},"subject":[]}}