{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:35Z","timestamp":1750220255539,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,18]]},"DOI":"10.1145\/3476883.3520223","type":"proceedings-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T02:11:49Z","timestamp":1651716709000},"page":"173-180","source":"Crossref","is-referenced-by-count":1,"title":["On fast implementations of elliptic curve point multiplication"],"prefix":"10.1145","author":[{"given":"Einstein","family":"Morales","sequence":"first","affiliation":[{"name":"University of Puerto Rico at Mayag\u00fcez"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2019415"},{"key":"e_1_3_2_1_2_1","volume-title":"Elliptic Curves of Prime Order Over Optimal Extension Fields for Use in Cryptography. In INDOCRYPT 2001 - Second International Conference on Cryptology in India","author":"Baier Harald","year":"2001","unstructured":"Harald Baier . 2001 . Elliptic Curves of Prime Order Over Optimal Extension Fields for Use in Cryptography. In INDOCRYPT 2001 - Second International Conference on Cryptology in India ( Chennai, India) (LNCS, 2247). Springer, 99--107. http:\/\/tubiblio.ulb.tu-darmstadt.de\/100904\/ Harald Baier. 2001. Elliptic Curves of Prime Order Over Optimal Extension Fields for Use in Cryptography. In INDOCRYPT 2001 - Second International Conference on Cryptology in India (Chennai, India) (LNCS, 2247). Springer, 99--107. http:\/\/tubiblio.ulb.tu-darmstadt.de\/100904\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055748"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.FIPS.186-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.08.005"},{"key":"e_1_3_2_1_7_1","unstructured":"Safuat Hamdy. 2001. LiDIA - A Library for Computational Number Theory - Reference Manual.  Safuat Hamdy. 2001. LiDIA - A Library for Computational Number Theory - Reference Manual."},{"volume-title":"Guide to Elliptic Curve Cryptography","author":"Hankerson Darrel","key":"e_1_3_2_1_8_1","unstructured":"Darrel Hankerson , Alfred Menezes , and Scott Vanstone . 2003. Guide to Elliptic Curve Cryptography . Springer-Verlag , Berlin, Heidelberg . Darrel Hankerson, Alfred Menezes, and Scott Vanstone. 2003. Guide to Elliptic Curve Cryptography. Springer-Verlag, Berlin, Heidelberg."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2016.0033"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958491"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3390\/s20185148"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/cta.2295"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/cta.2759"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2375640"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2013.6815461"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2015.2391274"}],"event":{"name":"ACM SE '22: 2022 ACM Southeast Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Virtual Event","acronym":"ACM SE '22"},"container-title":["Proceedings of the ACM Southeast Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3520223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476883.3520223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:45Z","timestamp":1750188645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476883.3520223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":15,"alternative-id":["10.1145\/3476883.3520223","10.1145\/3476883"],"URL":"https:\/\/doi.org\/10.1145\/3476883.3520223","relation":{},"subject":[],"published":{"date-parts":[[2022,4,18]]}}}