{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:22:07Z","timestamp":1773706927456,"version":"3.50.1"},"reference-count":0,"publisher":"American Mathematical Society (AMS)","issue":"237","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"published-print":{"date-parts":[[2001,3,7]]},"DOI":"10.1090\/s0025-5718-01-01310-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T18:13:45Z","timestamp":1027707225000},"page":"379-392","source":"Crossref","is-referenced-by-count":43,"title":["Some baby-step giant-step  algorithms  for the low hamming weight  discrete logarithm problem"],"prefix":"10.1090","volume":"71","author":[{"given":"D. R.","family":"Stinson","sequence":"first","affiliation":[]}],"member":"14","container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2002-71-237\/S0025-5718-01-01310-2\/S0025-5718-01-01310-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:02:48Z","timestamp":1773702168000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2002-71-237\/S0025-5718-01-01310-2\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3,7]]},"references-count":0,"journal-issue":{"issue":"237","published-print":{"date-parts":[[2002,1,1]]}},"alternative-id":["S0025571801013102"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-01-01310-2","relation":{},"ISSN":["0025-5718"],"issn-type":[{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3,7]]}}}