{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:26:10Z","timestamp":1730280370948,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/iwsda46143.2019.8966127","type":"proceedings-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T03:10:49Z","timestamp":1579835449000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["An Approach for Computing the Number of Points on Elliptic Curve y<sup>2<\/sup> = x<sup>3<\/sup> + a (mod p) via Explicit Formula for That Number Modulo p"],"prefix":"10.1109","author":[{"given":"Yuri","family":"Borissov","sequence":"first","affiliation":[]},{"given":"Miroslav","family":"Markov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4"},{"journal-title":"Elliptic Curves Number Theory and Cryptography","year":"2003","author":"washington","key":"ref3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_38"},{"journal-title":"Elements of Number Theory","year":"1954","author":"vinogradov","key":"ref6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.08.020"},{"journal-title":"History of the Theory of Numbers","year":"1919","author":"dickson","key":"ref8"},{"journal-title":"Mathematical Discovery","year":"1962","author":"polya","key":"ref7"},{"key":"ref2","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 Comp"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-39799-X_26","article-title":"An \n\nm\n\n\n3\n\n public-key encryption scheme","volume":"218","author":"williams","year":"1986","journal-title":"Lectures Notes in Computer Science &#x2013; Crypto 85"},{"key":"ref1","first-page":"220","article-title":"Elliptic curve cryptosystems; too good to be true?","author":"van tilborg","year":"2001","journal-title":"NAW 5\/2"}],"event":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","start":{"date-parts":[[2019,10,20]]},"location":"Dongguan, China","end":{"date-parts":[[2019,10,24]]}},"container-title":["2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8958968\/8966085\/08966127.pdf?arnumber=8966127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:53:54Z","timestamp":1658094834000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8966127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iwsda46143.2019.8966127","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}