{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T14:59:22Z","timestamp":1703084362629},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T00:00:00Z","timestamp":1132185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T00:00:00Z","timestamp":1132185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s00200-005-0187-7","type":"journal-article","created":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T12:25:34Z","timestamp":1132230334000},"page":"461-472","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the low hamming weight discrete logarithm problem for nonadjacent representations"],"prefix":"10.1007","volume":"16","author":[{"given":"J.A.","family":"Muir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,17]]},"reference":[{"key":"187_CR1","first-page":"215","volume":"69","author":"Chase","year":"1989","unstructured":"Chase, P.J.: Combination generation and graylex ordering. Congressus Numerantium 69, 215\u2013242 (1989)","journal-title":"Congressus Numerantium"},{"key":"187_CR2","unstructured":"Deng, D., Stinson, D.R., Li, P.C., van Rees, G.H.J., Wei, R.: Constructions and bounds for splitting systems. Submitted"},{"key":"187_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"Eades","year":"1984","unstructured":"Eades, P., McKay, B.: An algorithm for generating subsets of fixed size with a strong minimal change property. Information Processing Letters 19, 131\u2013133 (1984)","journal-title":"Information Processing Letters"},{"key":"187_CR4","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-47555-9_38","volume":"658","author":"Heiman","year":"1993","unstructured":"Heiman, R.: A note on discrete logarithms with special structure. Lecture Notes in Computer Science 658, 454\u2013457 (1993) (Advances in Cryptology \u2013 EUROCRYPT '92)","journal-title":"Lecture Notes in Computer Science"},{"key":"187_CR5","first-page":"153","volume":"40","author":"Jenkyns","year":"1995","unstructured":"Jenkyns, T.A., McCarthy, D.: Generating all k-subsets of {1, . . . , n} with minimal changes. Ars Combinatoria 40, 153\u2013159 (1995)","journal-title":". . , n} with minimal changes. Ars Combinatoria"},{"key":"187_CR6","unstructured":"Knuth, D.E.: The Art of Computer Programming, Pre-fascicle 3A. A Draft of Section 7.2.1.3: Generating all Combinations. Version of Sepetmber 2, 2004"},{"key":"187_CR7","doi-asserted-by":"crossref","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration and Search, CRC Press 1999","DOI":"10.1145\/309739.309744"},{"key":"187_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0012-365X(03)00280-2","volume":"279","author":"Ling","year":"2004","unstructured":"Ling, A.C.H., Li, P.C., van Rees, G.H.J.: Splitting systems and separating systems. Discrete Mathematics 279, 355\u2013368 (2004)","journal-title":"Discrete Mathematics"},{"key":"187_CR9","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, CRC Press 1996"},{"key":"187_CR10","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"Morain","year":"1990","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Informatique Th\u00e9orique et Applications 24, 531\u2013543 (1990)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"187_CR11","unstructured":"Muir, J.A., Stinson, D.R.: Minimality and other properties of the width-w nonadjacent form. To appear in Mathematics of Computation"},{"key":"187_CR12","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Review 39, 605\u2013629 (1997)","journal-title":"SIAM Review"},{"key":"187_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"Stinson","year":"2002","unstructured":"Stinson, D.R.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Mathematics of Computation 71, 379\u2013391 (2002)","journal-title":"Mathematics of Computation"},{"key":"187_CR14","unstructured":"Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: Public-Key Cryptography and Computational Number Theory, pp. 283\u2013301. Walter de Gruyter, 2001"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-005-0187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-005-0187-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-005-0187-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-005-0187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T01:07:41Z","timestamp":1652490461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-005-0187-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,17]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["187"],"URL":"https:\/\/doi.org\/10.1007\/s00200-005-0187-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,17]]},"assertion":[{"value":"13 October 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2005","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}