{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:35:10Z","timestamp":1768350910850,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425212","type":"print"},{"value":"9783540447092","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_30","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:04:18Z","timestamp":1186841058000},"page":"364-376","source":"Crossref","is-referenced-by-count":65,"title":["Implementation of RSA Algorithm Based on RNS Montgomery Multiplication"],"prefix":"10.1007","author":[{"given":"Hanae","family":"Nozaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Motoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Shimbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinichi","family":"Kawamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"S. Kawamura, M. Koike, F. Sano, and A. Shimbo, \u201cCox-Rower Architecture for Fast Montgomery Multiplication,\u201d EUROCRYPT 2000, pp. 523\u2013538 (2000).","DOI":"10.1007\/3-540-45539-6_37"},{"issue":"5","key":"30_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"K. C. Posch","year":"1995","unstructured":"K. C. Posch and R. Posch, \u201cModulo Reduction in Residue Number Systems,\u201d IEEE Tr. Parallel and Distributed Systems, Vol. 6, No. 5, pp. 449\u2013454 (1995).","journal-title":"IEEE Tr. Parallel and Distributed Systems"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"J.-C. Bajard, L.-S. Didier, and P. Kornerup, \u201cAn RNS Montgomery Multiplication Algorithm,\u201d Proceedings of ARITH13, IEEE Computer Society, pp. 234\u2013239 (1997).","DOI":"10.1109\/ARITH.1997.614900"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"P. Paillier, \u201cLow-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor,\u201d PKC99, pp. 223\u2013234 (1999).","DOI":"10.1007\/3-540-49162-7_18"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"E. Kranakis, \u201cPrimality and Cryptography,\u201d Wiley-Teubner Series in Computer Science, John Willy & Sons (1986).","DOI":"10.1007\/978-3-322-96647-6"},{"key":"30_CR6","unstructured":"RSA Laboratories, \u201cPKCS#1 Ver.2.0: RSA Cryptography Standard,\u201d Oct. 1 (1998)."},{"key":"30_CR7","unstructured":"http:\/\/www.rainbow.com\/cryptoswift ."},{"key":"30_CR8","unstructured":"http:\/\/www.pcc.pijnenburg.nl\/pcc-ises.htm ."}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:23:39Z","timestamp":1737361419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}