{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:38:23Z","timestamp":1742395103830},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432241"},{"type":"electronic","value":"9783540457602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45760-7_4","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:11:12Z","timestamp":1184962272000},"page":"40-52","source":"Crossref","is-referenced-by-count":11,"title":["Montgomery in Practice: How to Do It More Efficiently in Hardware"],"prefix":"10.1007","author":[{"given":"Lejla","family":"Batina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geeke","family":"Muurling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 1999","author":"A.F. Tenca","year":"1999","unstructured":"A.F. Tenca and \u00c7.K. Ko\u00e7. A scalable architecture for Montgomery multiplication. Lecture Notes in Computer Science, Springer-Verlag, (1717):94\u2013108, 1999. Cryptographic Hardware and Embedded Systems-CHES 1999."},{"unstructured":"T. Blum. Modular exponentiation on reconfigurable hardware. Master\u2019s thesis, Worcester Polytechnic Institute, April 1999.","key":"4_CR2"},{"doi-asserted-by":"crossref","unstructured":"S.E. Eldridge and C.D. Walter. Hardware implementation of Montgomery\u2019s modular multiplication algorithm. IEEE Transactions on Computers, (42):693\u20139, 1993.","key":"4_CR3","DOI":"10.1109\/12.277287"},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","first-page":"281","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2000","author":"E. Sava\u00e7","year":"2000","unstructured":"E. Sava\u00e7, A.F. Tenca, and \u00c7.K. Ko\u00e7. A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m). Lecture Notes in Computer Science, Springer-Verlag,Cryptographic Hardware and Embedded Systems-CHES 2000, (1965):281\u2013296, 2000."},{"unstructured":"G. Hachez, F. Koeune, and J.-J. Quisquater. Timing attack: what can be achieved by a powerful adversary? Proceedings of the 20th symposium on Information Theory in the Benelux, pages 63\u201370, May 1999.","key":"4_CR5"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-44499-8_23","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2000","author":"G. Hachez","year":"2000","unstructured":"G. Hachez and J.-J. Quisquater. Montgomery exponentiation with no final subtractions: Improved results. Lecture Notes in Computer Science, Springer-Verlag, (1965):293\u2013301, 2000. Cryptographic Hardware and Embedded Systems-CHES 2000."},{"key":"4_CR7","first-page":"477","volume":"1440","author":"K. Iwamura","year":"1981","unstructured":"K. Iwamura, T. Matsumoto, and H. Imai. Systolic-arrays for modular exponentiation using Montgomery method. Lecture Notes in Computer Science, Springer-Verlag, 1440:477\u2013481, 1981-1996. presented in Rumpsession of Eurocrypt 1992, May 24\u201328.","journal-title":"Lecture Notes in Computer Science"},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","first-page":"221","volume-title":"Advances in Cryptology-EUROCRYPT 92","author":"K. Iwamura","year":"1992","unstructured":"K. Iwamura, T. Matsumoto, and H. Imai. High-speed implementation methods for RSA scheme. Lecture Notes in Computer Science, Springer-Verlag, 658:221\u2013238, 1992. Advances in Cryptology-EUROCRYPT 92."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/ecjc.4430770304","volume":"77","author":"K. Iwamura","year":"1994","unstructured":"K. Iwamura, T. Matsumoto, and H. Imai. Montgomery modular multiplication method and systolic arrays suitable for modular exponentiation. Electronics and Communications in Japan, 77(3):40\u201350, 1994.","journal-title":"Electronics and Communications in Japan"},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology-CRYPTO 96","author":"P. Kocher","year":"1996","unstructured":"P. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. Lecture Notes in Computer Science, Springer-Verlag, pages 104\u2013113, 1996. Advances in Cryptology-CRYPTO 96."},{"unstructured":"P. Kocher, J. Jaffie, and B. Jun. Introduction to differential power analysis and related attacks. http:\/\/www.cryptography.com\/dpa\/technical , 1998.","key":"4_CR11"},{"key":"4_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology-CRYPTO 99","author":"P. Kocher","year":"1999","unstructured":"P. Kocher, J. Jaffie, and B. Jun. Differential power analysis. Lecture Notes in Computer Science, Springer-Verlag, pages 388\u2013397, 1999. Advances in Cryptology-CRYPTO 99."},{"issue":"8","key":"4_CR13","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/12.295851","volume":"43","author":"P. Kornerup","year":"1994","unstructured":"Peter Kornerup. A systolic, linear-array multiplier for a class of right-shift algorithms. IEEE Transactions on Computers, 43(8):892\u2013898, August 1994.","journal-title":"IEEE Transactions on Computers"},{"unstructured":"Erwin Kuipers. Design of an RSA crypto-processor using a systolic array. Master\u2019s thesis, Technical University of Eindhoven, The Netherlands, June 1996.","key":"4_CR14"},{"unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.","key":"4_CR15"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"P. Montgomery. Modular multiplication without trial division. Mathematics of Computation, Vol. 44:519\u2013521, 1985.","journal-title":"Mathematics of Computation"},{"key":"4_CR17","series-title":"Lect Notes Comput Sci","first-page":"189","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2001","author":"A. F. Tenca","year":"2001","unstructured":"A. F. Tenca, Georgi Todorov, and \u00c7. K. Ko\u00e7. High-radix design of a scalable modular multiplier. Lecture Notes in Computer Science, Springer-Verlag, (2162):189\u2013205, 2001. Cryptographic Hardware and Embedded Systems-CHES 2001."},{"unstructured":"Compaq. Cryptography using Compaq MultiPrime technology in a parallel processing environment. http:\/\/www.compaq.com , Electronic Commerce Technical Brief, January 2000.","key":"4_CR18"},{"key":"4_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45353-9_18","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"E. Trichina","year":"2001","unstructured":"E. Trichina and A. Tiountchik. Scalable algorithm for Montgomery multiplication and its implementation on the coarse-grain reconfigurable chip. Lecture Notes in Computer Science, Springer-Verlag, (2020):235\u2013249, 2001. Topics in Cryptology-CT-RSA 2001."},{"issue":"21","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"C.D. Walter","year":"1999","unstructured":"C.D. Walter. Montgomery exponentiation needs no final subtraction. Electronic letters, 35(21):1831\u20131832, October 1999.","journal-title":"Electronic letters"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1049\/ip-cdt:20000638","volume":"147","author":"C.D. Walter","year":"2000","unstructured":"C.D. Walter. Improved linear systolic array for fast modular exponentiation. IEEE Computers and Digital Techniques, 147(5):323\u2013328, September 2000.","journal-title":"IEEE Computers and Digital Techniques"},{"key":"4_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45760-7_3","volume-title":"RSA 2002 Cryptographers\u2019 track","author":"C.D. Walter","year":"2002","unstructured":"C.D. Walter. Precise bounds for Montgomery modular multiplication and some potentially insecure RSA moduli. Lecture Notes in Computer Science, Springer-Verlag, RSA 2002 Cryptographers\u2019 track (2271):30\u201339, 2002, (This Volume)."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/12.210181","volume":"42","author":"C.D. Walter","year":"1993","unstructured":"C.D. Walter. Systolic modular multiplication. IEEE Transactions on Computers, (42):376\u2013378, 1993.","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-45353-9_15","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"C.D. Walter","year":"2001","unstructured":"C.D. Walter and S. Thompson. Distinguishing exponent digits by observing modular subtractions. Lecture Notes in Computer Science, Springer-Verlag, (2020):192\u2013207, 2001. Topics in Cryptology-CT-RSA 2001."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:06:57Z","timestamp":1556708817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}