{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:20:34Z","timestamp":1772806834938,"version":"3.50.1"},"reference-count":24,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3934\/amc.2017038","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T10:06:45Z","timestamp":1504087605000},"page":"453-469","source":"Crossref","is-referenced-by-count":10,"title":["Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm"],"prefix":"10.3934","volume":"11","author":[{"given":"Steven D.","family":"Galbraith","sequence":"first","affiliation":[]},{"given":"Ping","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shenzhen University, Shenzhen 518060, China"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2017038-1","doi-asserted-by":"publisher","unstructured":"D. J. Bernstein and T. Lange, Computing small discrete logarithms faster, in <i>INDOCRYPT2012<\/i> (eds. S. D. Galbraith et al), Springer, 2012,317\u2013338.","DOI":"10.1007\/978-3-642-34931-7_19"},{"key":"key-10.3934\/amc.2017038-2","doi-asserted-by":"publisher","unstructured":"D. J. Bernstein and T. Lange, Two grumpy giants and a baby, in <i>Proc. 10th Algor. NumberTheory Symp. <\/i> (eds. E. W. Howe et al), 2013, 87\u2013111.","DOI":"10.2140\/obs.2013.1.87"},{"key":"key-10.3934\/amc.2017038-3","doi-asserted-by":"publisher","unstructured":"D. J. Bernstein, T. Lange and P. Schwabe, On the correct use of the negation map in thePollard rho method, in <i>PKC 2011<\/i> (eds. D. Catalano et al), Springer, 2011,128\u2013146.","DOI":"10.1007\/978-3-642-19379-8_8"},{"key":"key-10.3934\/amc.2017038-4","doi-asserted-by":"publisher","unstructured":"D. Boneh, E. Goh and K. Nissim, Evaluating 2-DNF formulas on ciphertexts in <i>Theory of Cryptography-TCC 2005<\/i> (ed. J. Kilian), Springer, 2005,325-341.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"key-10.3934\/amc.2017038-5","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10033"},{"key":"key-10.3934\/amc.2017038-6"},{"key":"key-10.3934\/amc.2017038-7","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2012-02641-X"},{"key":"key-10.3934\/amc.2017038-8","doi-asserted-by":"publisher","unstructured":"S. D. Galbraith and R. S. Ruprai, Using equivalence classes to speed up the discrete logarithmproblem in a short interval, in <i>PKC 2010<\/i> (eds. P. Nguyen et al), Springer, 2010,368\u2013383.","DOI":"10.1007\/978-3-642-13013-7_22"},{"key":"key-10.3934\/amc.2017038-9","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01119-9"},{"key":"key-10.3934\/amc.2017038-10","doi-asserted-by":"publisher","unstructured":"P. Gaudry and E. Schost, A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm, in <i>ANTS \u2165<\/i> (ed. D. A. Buell), Springer, 2004,208\u2013222.","DOI":"10.1007\/978-3-540-24847-7_15"},{"key":"key-10.3934\/amc.2017038-11","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157000001194"},{"key":"#cr-split#-key-10.3934\/amc.2017038-12.1","doi-asserted-by":"crossref","unstructured":"R. Henry, K. Henry and I. Goldberg, Making a nymbler Nymble using VERBS, in <i>PETS 2010<\/i>","DOI":"10.1007\/978-3-642-14527-8_7"},{"key":"#cr-split#-key-10.3934\/amc.2017038-12.2","doi-asserted-by":"crossref","unstructured":"(eds. M. J. Atallah), Springer, 2010,111-129.","DOI":"10.3917\/top.111.0129"},{"key":"key-10.3934\/amc.2017038-13","doi-asserted-by":"publisher","DOI":"10.2307\/2007884"},{"key":"key-10.3934\/amc.2017038-14","doi-asserted-by":"publisher","unstructured":"V. Miller, Use of elliptic curves in cryptography, in <i>Crypto '85<\/i> (ed. H. C. Williams), Springer, 1986,417\u2013426.","DOI":"10.1007\/3-540-39799-X_31"},{"key":"key-10.3934\/amc.2017038-15","doi-asserted-by":"publisher","DOI":"10.2307\/2007888"},{"key":"key-10.3934\/amc.2017038-16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02113297"},{"key":"key-10.3934\/amc.2017038-17","doi-asserted-by":"publisher","DOI":"10.2307\/2006496"},{"key":"key-10.3934\/amc.2017038-18","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010010"},{"key":"key-10.3934\/amc.2017038-19","unstructured":"D. Shanks, Five number-theoretic algorithms, in <i>Proc. 2nd Manitoba Conf. Numer. Math. <\/i>, Winnipeg, 1973, 51\u201370."},{"key":"key-10.3934\/amc.2017038-20","doi-asserted-by":"publisher","DOI":"10.1007\/PL00003816"},{"key":"key-10.3934\/amc.2017038-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.01.044"},{"key":"key-10.3934\/amc.2017038-22","doi-asserted-by":"publisher","unstructured":"P. Wang and F. Zhang, Improving the parallelized Pollard rho method for computing elliptic curve discrete logarithms in <i>4th Int. Conf. Emerging Intell. Data Web Techn. (EIDWT-2013)<\/i> 2013.","DOI":"10.1109\/EIDWT.2013.55"},{"key":"key-10.3934\/amc.2017038-23","doi-asserted-by":"publisher","unstructured":"M. Wiener and R. Zuccherato, Faster attacks on elliptic curve cryptosystems, in <i>SelectedAreas in Cryptography '98<\/i> (eds. S. E. Tavares et al), Springer, 1998,190\u2013120.","DOI":"10.1007\/3-540-48892-8_15"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2017_3_453.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:01:24Z","timestamp":1772791284000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2017038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2017038","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}