{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:34Z","timestamp":1772283634868,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1008374325369","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"53-64","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Rabin-type Digital Signature Scheme"],"prefix":"10.1007","volume":"16","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Wakaha","family":"Ogata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"189030_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman, K. Manders, and G. Miller, On taking roots in finite fields, Proceedings of 18th IEEE symposium on Foundations of Computer Science (1977) pp. 175-178.","DOI":"10.1109\/SFCS.1977.18"},{"key":"189030_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, Proceedings of 1st ACM Conference on Computer and Communications Security (1993).","DOI":"10.1145\/168588.168596"},{"key":"189030_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":"Proc. of Eurocrypt'96","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway, The exact security of digital signatures \u2014 how to sign with RSA and Rabin, Proc. of Eurocrypt'96, Vol. 1070 of Lecture Notes in Computer Science, Springer Verlag, Berlin (1996) pp. 399-416."},{"key":"189030_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0310-7","volume-title":"A Course in Number Theory and Cryptography","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, Berlin (1987)."},{"issue":"4","key":"189030_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/0161-118891862972","volume":"XII","author":"K. Kurosawa","year":"1988","unstructured":"K. Kurosawa, T. Itoh, and M. Takeuchi, Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number, CRYPTOLOGIA, Vol.XII,No.4 (1988) pages 225-233. (Also, available from http:\/\/tsk-www.ss.titech.ac.jp\/~kurosawa\/)","journal-title":"CRYPTOLOGIA"},{"key":"189030_CR6","series-title":"Technical Report","volume-title":"Digitalized signatures and public key cryptosystems as intractable as factorization","author":"M.O. Rabin","year":"1979","unstructured":"M.O. Rabin, Digitalized signatures and public key cryptosystems as intractable as factorization, Technical Report MIT\/LCS\/TR-212, MIT, Cambridge, MA (1979)."},{"issue":"2","key":"189030_CR7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM, Vol.21,no.2 (1978) pp. 120-126.","journal-title":"Communications of the ACM"},{"issue":"6","key":"189030_CR8","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"IT-26","author":"H.C. Williams","year":"1980","unstructured":"H.C. Williams, A modification of the RSA public-key encryption procedure, IEEE, IT, Vol.IT-26,No.6 (1980) pp. 726-729.","journal-title":"IEEE, IT"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008374325369.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008374325369\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008374325369.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:49:17Z","timestamp":1753760957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008374325369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["189030"],"URL":"https:\/\/doi.org\/10.1023\/a:1008374325369","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}