{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:32:32Z","timestamp":1736314352634,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643821"},{"type":"electronic","value":"9783540697671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030419","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:24:34Z","timestamp":1138202674000},"page":"174-187","source":"Crossref","is-referenced-by-count":3,"title":["A high-speed small RSA encryption LSI with low power dissipation"],"prefix":"10.1007","author":[{"given":"A.","family":"Satoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Niijima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Ooba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Munetoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adelman: \u201cA Method for Obtaining Digital Signatures and Public-key Cryptosystems,\u201d Comm. ACM, vol. 21, no. 2, pp. 120\u2013126, 1978.","journal-title":"Comm. ACM"},{"issue":"170","key":"15_CR2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"P. Montgomery: \u201cModular Multiplication without Trial Division,\u201d Mathematics of Computation, vol. 44, no. 170, pp. 519\u2013521, 1985.","journal-title":"Mathematics of Computation"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"P. Barret: \u201cImplementing the Rivest Shamir and Adelman Public Key Encryption Algorithm on a Standard Digital Signal Processor,\u201d Advances in Cryptology \u2014 Crypto '86, LNCS 263, Springer-Verlag, pp. 311\u2013323, 1987.","DOI":"10.1007\/3-540-47721-7_24"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"H. Sedlak: \u201cThe RSA Cryptography Processor,\u201d Advances in Cryptology \u2014 Eurocrypt'87, LNCS 293, Springer-Verlag, pp. 95\u2013105, 1988.","DOI":"10.1007\/3-540-39118-5_10"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"D. de Waleffe and J-J.Quisquater: \u201cCORSAIR: A Smart Card for Public Key Cryptosystems,\u201d Advances in Cryptology \u2014 Crypto '90, LNCS 537, Springer-Verlag pp. 503\u2013513, 1990.","DOI":"10.1007\/3-540-38424-3_35"},{"issue":"3","key":"15_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/40.502402","volume":"16","author":"D. Naccache","year":"1996","unstructured":"D. Naccache and D. M'Raihi: \u201cCryptographic Smart Cards,\u201d IEEE Micro, vol. 16, no. 3, pp. 14\u201324, June 1996.","journal-title":"IEEE Micro"},{"issue":"4","key":"15_CR7","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1109\/4.34094","volume":"24","author":"P. A. Ivey","year":"1989","unstructured":"P. A. Ivey, A. L. Cox, J. R. Harbridge and J. K. Oldfield: \u201cA Single-Chip Public Key Encryption System,\u201d IEEE J. Solid-State Circuits, vol. 24, no. 4, pp. 1071\u20131075, Aug. 1989.","journal-title":"IEEE J. Solid-State Circuits"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. Shand and J. Vuillemin: \u201cFast Implementations of RSA Cryptography,\u201d Proceedings of the 11th IEEE Symp. on Computer Arithmetic, pp. 252\u2013259, 1993.","DOI":"10.1109\/ARITH.1993.378085"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"P. A. Ivey, S. N. Walker, J. M. Stern and S. Davidson: \u201cAn Ultra-High Speed Public Key Encryption Processor,\u201d Proceedings of IEEE 1992 Custom Integrated Circuits Conf. pp. 19.6.1-19.6.4, May 1992.","DOI":"10.1109\/CICC.1992.591336"},{"issue":"3","key":"15_CR10","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/4.102670","volume":"25","author":"A. Vandemeulebroeck","year":"1990","unstructured":"A. Vandemeulebroeck, E. Vanzieleghem, T. Denayer, and P. G. A. Jespers: \u201cA New Carry-Free Division Algorithm and its Application to a Single-Chip 1024-b RSA Processor,\u201d IEEE J. Solid-State Circuits, vol. 25, no. 3, pp. 748\u2013756, June 1990.","journal-title":"IEEE J. Solid-State Circuits"},{"key":"15_CR11","unstructured":"FIPS PUB 46, \u201cData Encryption Standard,\u201d National Bureau of Standards, 1977."},{"key":"15_CR12","unstructured":"FIPS PUB 81, \u201cDES Modes of Operation,\u201d National Bureau of Standards, 1980."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"R. Rivest: \u201cThe MD5 Message-Digest Algorithm,\u201d RFC 1321, Apr. 1992.","DOI":"10.17487\/rfc1321"},{"key":"15_CR14","unstructured":"http:\/\/www.pijnenburg.nl, Pijnenburg Beheer N.V."},{"key":"15_CR15","unstructured":"http:\/\/www.nel.co.jp, NTT Electronics Co."},{"key":"15_CR16","unstructured":"http:\/\/www.siemens.de, Siemens AG."},{"key":"15_CR17","unstructured":"http:\/\/www.st.com, SGS-Thomson Microelectronics."},{"key":"15_CR18","unstructured":"http:\/\/www.philps.com, Philips."},{"key":"15_CR19","unstructured":"http:\/\/www.mcu.motsps.com, Motorola."},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1109\/TEC.1961.5219274","volume":"EC-10","author":"M. Lehman","year":"1961","unstructured":"M. Lehman and N. Burla: \u201cSkip Techniques for High-Speed Carry Propagation in Binary Arithmetic Units,\u201d IRE Trans. Elec. Comput., vol. EC-10, pp. 691\u2013698, Dec. 1961.","journal-title":"IRE Trans. Elec. Comput."},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/IRETELC.1962.5407919","volume":"EC-11","author":"O. J. Bedrij","year":"1962","unstructured":"O. J. Bedrij: \u201cCarry-Select Adder,\u201d IRE Trans. Elec. Comput., vol. EC-11, pp. 340\u2013346, June 1962.","journal-title":"IRE Trans. Elec. Comput."},{"issue":"156","key":"15_CR22","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0628717-0","volume":"34","author":"C. Pomerance","year":"1981","unstructured":"C. Pomerance: \u201cOn the Distribution of Pseudoprimes,\u201d Mathmatics of Computation, vol. 34, no. 156, pp. 587\u2013593, Oct. 1981.","journal-title":"Mathmatics of Computation"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:53:00Z","timestamp":1736250780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643821","9783540697671"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0030419","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}