{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:28:37Z","timestamp":1776842917603,"version":"3.51.2"},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":4003,"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":[[2002,8]]},"DOI":"10.1016\/s0893-9659(02)00031-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T08:14:51Z","timestamp":1034064891000},"page":"703-708","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Taking cube roots in"],"prefix":"10.1016","volume":"15","author":[{"given":"C","family":"Padr\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G","family":"S\u00e1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(02)00031-9_BIB1","article-title":"A Course in Computational Algebraic Number Theory","volume":"138","author":"Cohen","year":"1995"},{"key":"10.1016\/S0893-9659(02)00031-9_BIB2","author":"Adleman","year":"1977"},{"key":"10.1016\/S0893-9659(02)00031-9_BIB3","article-title":"Five number-theoretical algorithms","author":"Shanks","year":"1972"},{"issue":"6","key":"10.1016\/S0893-9659(02)00031-9_BIB4","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/TIT.1986.1057236","article-title":"A simple and fast probabilistic algorithm for computing square roots modulo a prime number","volume":"IT-32","author":"Peralta","year":"1986","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S0893-9659(02)00031-9_BIB5","first-page":"483","article-title":"Elliptic curves over finite fields and the computation of square roots mod p","volume":"43","author":"Schoof","year":"1985","journal-title":"Math. Comp."},{"key":"10.1016\/S0893-9659(02)00031-9_BIB6","article-title":"Computer technology applied to the theory of numbers","author":"Lehmer","year":"1969"},{"key":"10.1016\/S0893-9659(02)00031-9_BIB7","author":"Niven","year":"1966"},{"key":"10.1016\/S0893-9659(02)00031-9_BIB8","article-title":"Algebra","author":"Lang","year":"1971"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:06:10Z","timestamp":1760238370000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965902000319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0893965902000319"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(02)00031-9","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Taking cube roots in m","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(02)00031-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}