{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:47Z","timestamp":1764996887497},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205920"},{"type":"electronic","value":"9783540400615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_28","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:06:00Z","timestamp":1283727960000},"page":"434-451","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Powering Functions and Their Application to Digital Signatures"],"prefix":"10.1007","author":[{"given":"Hisayoshi","family":"Sato","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]},{"given":"Satoru","family":"Tezuka","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Takaragi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, New York (1993), Available at: http:\/\/www.cs.ucdavis.edu\/rogaway\/papers\/index.html","DOI":"10.1145\/168588.168596"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption \u2013 How to encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures \u2013 How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring N = prq for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"issue":"1","key":"28_CR5","first-page":"1","volume":"5","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast Variants of RSA. Cryptobytes\u00a05(1), 1\u20139 (2002)","journal-title":"Cryptobytes"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46035-7_18","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J.S. Coron","year":"2002","unstructured":"Coron, J.S.: Optimal security proofs for PSS and other signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"28_CR7","unstructured":"HIME(R): High Performance Modular Squaring Based Public-Key Encryption (Revised Edition), Hitachi, Ltd. (2001)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/0161-118891862972","volume":"12","author":"K. Kurokawa","year":"1988","unstructured":"Kurokawa, K., Ito, T., Takeuchi, M.: Public Key cryptosystem using a reciprocal number with the same intractability as factoring a large number. Cryptologia\u00a012, 225\u2013233 (1988)","journal-title":"Cryptologia"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/A:1008374325369","volume":"16","author":"K. Kurokawa","year":"1999","unstructured":"Kurokawa, K., Ogata, W.: Efficient Rabin-type Digital Signature Scheme. Designs, Codes and Cryptography\u00a016, 53\u201364 (1999)","journal-title":"Designs, Codes and Cryptography"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00193566","volume":"5","author":"J.H. Loxton","year":"1992","unstructured":"Loxton, J.H., Khoo, D.S.P., Bird, G.J., Seberry, J.: A cubic RSA code equivalent to factorization. Journal of Cryptology\u00a05, 139\u2013150 (1992)","journal-title":"Journal of Cryptology"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular mutiplication without trial division. Math. Comp.\u00a044, 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"key":"28_CR13","unstructured":"Public-Key Cryptography Standards, PKCS # 1, Amendment 1: Multi-Prime RSA, RSA Laboratories"},{"key":"28_CR14","unstructured":"Rabin, M.O.: Digitalized signatures and public key cryptosystems as intractable as factorization, Technical Report, MIT\/LCS\/TR-212, MIT, Cambridge, MA (1979)"},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s001459900038","volume":"11","author":"R. Scheidler","year":"1998","unstructured":"Scheidler, R.: A Public-Key Cryptosystem Using Purely Cubic Fields. J. Cryptology\u00a011, 109\u2013124 (1998)","journal-title":"J. Cryptology"},{"key":"28_CR17","unstructured":"Shoup, V.: A Proposal for an ISO Standard for Public Key Encryption (v. 2.1), ISO\/IEC JTC1\/SC27, N2563 (2001), Available at: http:\/\/www.shoup.net\/papers\/ or http:\/\/www.eprint.iacr.org\/"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo pkq. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 318\u2013326. Springer, Heidelberg (1998)"},{"issue":"6","key":"28_CR19","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"IT-26","author":"H.C. Williams","year":"1980","unstructured":"Williams, H.C.: A modification of the RSA public key encryption procedure. IEEE Trans. on Information Theory\u00a0IT-26(6), 726\u2013729 (1980)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"3","key":"28_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/0161-118591859942","volume":"9","author":"H.C. Williams","year":"1985","unstructured":"Williams, H.C.: Some public-key crypto-functions as intractable as factorization. Cryptologia\u00a09(3), 223\u2013237 (1985)","journal-title":"Cryptologia"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-39799-X_26","volume-title":"Advances in Cryptology","author":"H.C. Williams","year":"1986","unstructured":"Williams, H.C.: An M3 public-key encryption scheme. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 358\u2013368. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T21:18:36Z","timestamp":1559596716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}