{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:44Z","timestamp":1725493604538},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430261"},{"type":"electronic","value":"9783540453253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45325-3_33","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:51:25Z","timestamp":1193457085000},"page":"364-373","source":"Crossref","is-referenced-by-count":0,"title":["Another Way of Doing RSA Cryptography 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":[[2001,12,4]]},"reference":[{"key":"33_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 C.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."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"L. Batina and G. Muurling. Montgomery in practice: How to do it more efficiently in hardware. RSA 2002-San Jose, to appear, 2002.","DOI":"10.1007\/3-540-45760-7_4"},{"key":"33_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 CD. Walter. Hardware implementation of Montgomery\u2019s modular multiplication algorithm. IEEE Transactions on Computers, (42):693\u20139, 1993.","journal-title":"IEEE Transactions on Computers"},{"key":"33_CR4","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":"33_CR5","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."},{"issue":"3","key":"33_CR6","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":"33_CR7","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."},{"key":"33_CR8","unstructured":"P. Kocher, J. Jaffe, and B. Jun. Introduction to differential power analysis and related attacks, http:\/\/www.cryptography.com\/dpa\/technical , 1998."},{"key":"33_CR9","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. Jaffe, and B. Jun. Differential power analysis. Lecture Notes in Computer Science, Springer-Verlag, pages 388\u2013397, 1999. Advances in Cryptology-CRYPTO 99."},{"key":"33_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Third International Workshop on Practice and Theory in Public Key Cryptography-PKC 2000","author":"A. Lenstra","year":"2004","unstructured":"A. Lenstra and E. Verheul. Selecting cryptographic key sizes. In Hideki Imai and Yuiliang Zheng, editors, Third International Workshop on Practice and Theory in Public Key Cryptography-PKC 2000, LNCS 1751."},{"key":"33_CR11","unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997."},{"issue":"3","key":"33_CR12","first-page":"l","volume":"l","author":"A. Shamir","year":"1995","unstructured":"A. Shamir. Rsa for paranoids. RSA Laboratories\u2019 CryptoBytes, l(3):l\u20134, 1995.","journal-title":"RSA Laboratories\u2019 CryptoBytes"},{"issue":"21","key":"33_CR13","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"C.D. Walter","year":"1999","unstructured":"CD. Walter. Montgomery exponentiation needs no final subtraction. Electronic letters, 35(21):1831\u20131832, October 1999.","journal-title":"Electronic letters"},{"key":"33_CR14","unstructured":"CD. Walter. Safely reducing the number of iterations in Montgomery modular multiplication. 2001. preprint."},{"key":"33_CR15","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":"CD. 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","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45325-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:08:24Z","timestamp":1556921304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45325-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430261","9783540453253"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45325-3_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}