{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:41Z","timestamp":1760245001488,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4490,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0893-9659(00)00159-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:56:43Z","timestamp":1027601803000},"page":"341-346","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computing the order of points on an elliptic curve modulo N is as difficult as factoring N"],"prefix":"10.1016","volume":"14","author":[{"given":"S.","family":"Mart\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Morillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.L.","family":"Villar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0893-9659(00)00159-2_BIB1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. of ACM"},{"year":"1993","author":"Menezes","key":"10.1016\/S0893-9659(00)00159-2_BIB2"},{"issue":"2","key":"10.1016\/S0893-9659(00)00159-2_BIB3","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","article-title":"Factoring integers with elliptic curves","volume":"126","author":"Lenstra","year":"1987","journal-title":"Ann. of Math."},{"key":"10.1016\/S0893-9659(00)00159-2_BIB4","first-page":"316","article-title":"Almost all primes can be quickly certified","author":"Goldwasser","year":"1986","journal-title":"Proc. 18th STOC, ACM"},{"issue":"203","key":"10.1016\/S0893-9659(00)00159-2_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","article-title":"Elliptic curves and primality proving","volume":"61","author":"Atkin","year":"1993","journal-title":"Math. of Computation"},{"issue":"170","key":"10.1016\/S0893-9659(00)00159-2_BIB6","first-page":"483","article-title":"Elliptic curves over finite fields and the computation of square roots mod p","volume":"44","author":"Schoof","year":"1985","journal-title":"Math. of Computation"},{"year":"1992","author":"von York","key":"10.1016\/S0893-9659(00)00159-2_BIB7"},{"year":"1986","author":"Silverman","key":"10.1016\/S0893-9659(00)00159-2_BIB8"},{"key":"10.1016\/S0893-9659(00)00159-2_BIB9","first-page":"47","article-title":"Equivalence between counting the number of points on elliptic curves over the ring Zn and factoring n, LNCS 1403","author":"Kunihiro","year":"1998","journal-title":"Proceedings of Eurocrypt 1998"},{"key":"10.1016\/S0893-9659(00)00159-2_BIB10","first-page":"102","author":"Rif\u00e0","year":"1991","journal-title":"Comunicaci\u00f3n Digital"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965900001592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965900001592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:59:39Z","timestamp":1760237979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965900001592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0893965900001592"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(00)00159-2","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2001,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing the order of points on an elliptic curve modulo N is as difficult as factoring N","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(00)00159-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}