{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:34:22Z","timestamp":1725467662490},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645184"},{"type":"electronic","value":"9783540697954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054116","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T05:13:04Z","timestamp":1153977184000},"page":"47-58","source":"Crossref","is-referenced-by-count":9,"title":["Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n"],"prefix":"10.1007","author":[{"given":"Noboru","family":"Kunihiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Koyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"4_CR1","volume-title":"Technical Report UCB\/CSD 84\/186","author":"E. Bach","year":"1984","unstructured":"E. Bach. Discrete logarithm and factoring. Technical Report UCB\/CSD 84\/186, Computer Science Division (EECS), University of California, Berkley, Calfornia, 1984."},{"key":"4_CR2","unstructured":"L. Charlap, R. Coley and D. Robbins. Enumerate of rational points on elliptic curves over finite fields, preprint, 1991."},{"key":"4_CR3","first-page":"40","volume":"LNCS765","author":"N. Demytko","year":"1994","unstructured":"N. Demytko. A new elliptic curve based analogue of RSA. Proc. of EUROCRYPT'93, LNCS765: pp.40\u201349, 1994.","journal-title":"Proc. of EUROCRYPT'93"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48: pp.203\u2013209, 1987.","journal-title":"Mathematics of Computation"},{"key":"4_CR5","first-page":"345","volume":"LNCS576","author":"K. Koyama","year":"1992","unstructured":"K. Koyama, U. Mauer, T. Okamoto and S. Vanstone. New public-key schemes based on elliptic curves over the ring Zn. Proc. of CRYPT0'91, LNCS576: pp.345\u2013357, 1992.","journal-title":"Zn. Proc. of CRYPT0'91"},{"key":"4_CR6","first-page":"329","volume":"LNCS921","author":"K. Koyama","year":"1995","unstructured":"K. Koyama. Fast RSA-type scheme based on singular curves y2 + axy \u2261 x3 (mod n). Proc. of EUROCRYPT'95, LNCS921: pp.329\u2013340, 1995.","journal-title":"Proc. of EUROCRYPT'95"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. Lenstra","year":"1987","unstructured":"H. Lenstra. Factoring integer with elliptic curves. Ann. of Math., 126: pp.649\u2013673, 1987.","journal-title":"Ann. of Math."},{"key":"4_CR8","unstructured":"D. L. Long. Random equivalence of factorization and computation of orders. Technical Report 284, Princeton University, Department of Electrical Engineering and Computer Science, April 1981."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"A. Menezes. Elliptic curve public key cryptosystems. Kluwer academic publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"4_CR10","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. Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, 13: pp.300\u2013317, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR11","first-page":"417","volume":"LNCS218","author":"V. S. Miller","year":"1986","unstructured":"V. S. Miller. Use of elliptic curves in cryptography. Proc. of CRYPTO'85, LNCS218: pp.417\u2013426, 1986.","journal-title":"Proc. of CRYPTO'85"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"P. Riebenboim. The little book of big primes. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4757-4330-2"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof. Elliptic curve over finite fields and the computation of square roots mod p. Mathematics of Computation, 44: pp.483\u2013494, 1985.","journal-title":"p. Mathematics of Computation"},{"key":"4_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J. Silverman","year":"1986","unstructured":"J. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, New York, 1986. GTM 106."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0890-5401(87)90030-7","volume":"72","author":"H. Woll","year":"1987","unstructured":"H. Woll. Reductions among number theoretical problems. Information and Computation, 72: pp.167\u2013179, 1987.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T06:26:20Z","timestamp":1549866380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0054116","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}