{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:00:52Z","timestamp":1768420852200,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_20","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T11:03:27Z","timestamp":1186830207000},"page":"252-266","source":"Crossref","is-referenced-by-count":81,"title":["New Public-Key Schemes Based on Elliptic Curves over the Ring Zn"],"prefix":"10.1007","author":[{"given":"Kenji","family":"Koyama","sequence":"first","affiliation":[]},{"given":"Ueli M.","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Scott A.","family":"Vanstone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"175","volume":"20","author":"L. Adleman","year":"1977","unstructured":"L. Adleman, K. Manders, and G. Miller, \u201cOn taking roots in finite fields\u201d, 20th FOCS, Vol. 20, 1977, pp.175\u2013178 (1977).","journal-title":"20th FOCS"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"D. Chaum, \u201cBlind signatures for untraceable payments\u201d, Proc. of Crypto\u201982, pp.199\u2013203 (1982).","DOI":"10.1007\/978-1-4757-0602-4_18"},{"issue":"6","key":"20_CR3","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman, \u201cNew directions in cryptography, IEEE Transactions on Information Theory,\u201d Vol. 22, No. 6, pp. 644\u2013654 (1976).","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El-Gamal","year":"1985","unstructured":"T. El-Gamal, \u201cA public key cryptosystem and a signature scheme based on the discrete logarithm\u201d, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469\u2013472 (1985).","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and J. Kilian, \u201cAlmost all primes can be quickly certified\u201d, Proc. of the 18th Annual ACM Symposium on the Theory of Computing, pp. 316\u2013329 (1986).","DOI":"10.1145\/12130.12162"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"J. Hastad, \u201cOn using RSA with low exponent in a public key network\u201d, Proc. of Crypto\u201985, pp.403\u2013408 (1985).","DOI":"10.1007\/3-540-39799-X_29"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"W. Jonge and D. Chaum, \u201c Attacks on some RSA signatures\u201d, Proc. of Crypto\u201985, pp.18\u201327 (1985).","DOI":"10.1007\/3-540-39799-X_3"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"B.S. Kaliski, \u201cA pseudo-random bit generator based on elliptic logarithms\u201d, Proc. of Crypto\u201986, pp. 84\u2013103 (1987).","DOI":"10.1007\/3-540-47721-7_7"},{"key":"20_CR9","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, Berlin: Springer-Verlag, (1987)."},{"issue":"2","key":"20_CR10","first-page":"163","volume":"J-65","author":"K. Koyama","year":"1982","unstructured":"K. Koyama, \u201cA Master Key for the RSA public-key cryptosystem\u201d, I.E.C.E. Trans.(D), J-65,2, pp.163\u2013170 (1982).","journal-title":"I.E.C.E. Trans.(D)"},{"key":"20_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-96647-6","volume-title":"Primality and Cryptography","author":"E. Kranakis","year":"1986","unstructured":"E. Kranakis, Primality and Cryptography, Stuttgart: Teubner, and New York: John Wiley & Sons, (1986)."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, H.W. Lenstra, M.S. Manasse and J.M. Pollard, \u201cThe number field sieve\u201d, Proc. of STOC\u201990, pp.564\u2013572 (1990).","DOI":"10.1145\/100216.100295"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra and M.S. Manasse, \u201cFactoring with two large primes\u201d, Proc. of EUROCRYPT\u201990, pp.72\u201382 (1991)","DOI":"10.1007\/3-540-46877-3_7"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"H.W. Lenstra, \u201cFactoring integers with elliptic curves\u201d, Annals of Mathematics, Vol. 126, pp. 649\u2013673 (1987).","journal-title":"Annals of Mathematics"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"U.M. Maurer, \u201cFast generation of RSA-moduli with almost maximal diversity\u201d, Proc. of EUROCRYPT\u201989, pp. 636\u2013647 (1990).","DOI":"10.1007\/3-540-46885-4_60"},{"key":"20_CR16","unstructured":"U.M. Maurer and Y. Yacobi, \u201cNon-interactive public-key cryptography\u201d, to appear in Proc. Eurocrypt\u2019 91."},{"key":"20_CR17","unstructured":"J.L. Massey, \u201cCryptography \u2014 fundamentals and applications (Copies of transparencies)\u201d, Advanced Technology Seminars, Zurich, Switzerland, (1988)."},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G.L. Miller","year":"1976","unstructured":"G.L. Miller, \u201cRiemann\u2019s hypothesis and tests for primality\u201d, J. Comput. System Sci. Vol.13, pp.300\u2013317, (1976).","journal-title":"J. Comput. System Sci."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"A.J. Menezes, T. Okamoto, S.A. Vanstone, \u201cReducing Elliptic Curve Logarithms to Logarithms in a Finite Field\u201d, Proc. of STOC\u201991, pp.80\u201389 (1991).","DOI":"10.1145\/103418.103434"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"M.O. Rabin, \u201cProbabilistic algorithm for testing primality\u201d, Journal on Number Theory, Vol. 12, pp. 128\u2013138 (1980).","journal-title":"Journal on Number Theory"},{"key":"20_CR21","doi-asserted-by":"publisher","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, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Communications of the ACM, Vol. 21, No. 2, pp. 120\u2013126 (1978).","journal-title":"Communications of the ACM"},{"issue":"170","key":"20_CR22","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof, \u201cElliptic curves over finite fields and the computation of square roots mod p\u201d, Mathematics of Computation, Vol. 44, No. 170, pp. 483\u2013494 (1985).","journal-title":"Mathematics of Computation"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"J.H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, (1986).","DOI":"10.1007\/978-1-4757-1920-8"},{"issue":"4","key":"20_CR24","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1080\/0161-117791833219","volume":"1","author":"G. Simmons","year":"1977","unstructured":"G. Simmons and M. Norris, \u201cPreliminary comments on the M.I.T. public key cryptosystem\u201d, Cryptologia, Vol. 1, No. 4, pp. 406\u2013414 (1977).","journal-title":"Cryptologia"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J. Stein","year":"1961","unstructured":"J. Stein, \u201cComputational problems associated with Racah algebra\u201d, J. Comp. Phys., Vol. 1, pp. 397\u2013405 (1961).","journal-title":"J. Comp. Phys."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:27Z","timestamp":1605629607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_20","relation":{},"subject":[]}}