{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:55Z","timestamp":1740122515886,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Project","award":["2018YFA0704702"],"award-info":[{"award-number":["2018YFA0704702"]}]},{"name":"Major Basic Research Project of Natural Science Foundation of Shandong Province","award":["ZR202010220025"],"award-info":[{"award-number":["ZR202010220025"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00966-5","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T18:02:46Z","timestamp":1635530566000},"page":"107-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving the Gaudry\u2013Schost algorithm for multidimensional discrete logarithms"],"prefix":"10.1007","volume":"90","author":[{"given":"Haoxuan","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1159-7597","authenticated-orcid":false,"given":"Jincheng","family":"Zhuang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,29]]},"reference":[{"key":"966_CR1","first-page":"87","volume-title":"Proceedings of the Tenth Algorithmic Number Theory Symposium","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein D.J., Lange T.: Two grumpy giants and a baby. In: Howe E.W., Kedlaya K.S. (eds.) Proceedings of the Tenth Algorithmic Number Theory Symposium, pp. 87\u2013111. Springer, New York (2013)."},{"unstructured":"Brands S.: An efficient off-line electronic cash system based on the representation problem. CWI Technical Report CS-R9323 (1993).","key":"966_CR2"},{"doi-asserted-by":"crossref","unstructured":"Cramer R., Shoup V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Annual International Cryptology Conference, pp. 13\u201325. Springer, New York (1998).","key":"966_CR3","DOI":"10.1007\/BFb0055717"},{"key":"966_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology: EUROCRYPT","author":"R Cramer","year":"1997","unstructured":"Cramer R., Gennaro R., Schoenmakers B.: A secure and optimally efficient multi-authority election scheme. In: Fumy W. (ed.) Advances in Cryptology: EUROCRYPT, vol. 1233, pp. 103\u2013118. Lecture Notes in Computer Science. Springer, New York (1997)."},{"issue":"6","key":"966_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W., Hellman M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"966_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Galbraith S., Ruprai R.S.: An improvement to the Gaudry\u2013Schost algorithm for multidimensional discrete logarithm problems. In: IMA International Conference on Cryptography and Coding, pp. 368\u2013382. Springer, New York (2009).","key":"966_CR7","DOI":"10.1007\/978-3-642-10868-6_22"},{"doi-asserted-by":"crossref","unstructured":"Galbraith S.D., Ruprai R.S.: Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval. In: International Workshop on Public Key Cryptography, pp. 368\u2013383. Springer, New York (2010).","key":"966_CR8","DOI":"10.1007\/978-3-642-13013-7_22"},{"key":"966_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"SD Galbraith","year":"2012","unstructured":"Galbraith S.D.: Mathematics of Public Key Cryptography. Cambridge University Press, Cambridge (2012)."},{"issue":"10\u201311","key":"966_CR10","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1016\/j.dam.2012.02.019","volume":"160","author":"SD Galbraith","year":"2012","unstructured":"Galbraith S.D., Holmes M.: A non-uniform birthday problem with applications to discrete logarithms. Discret. Appl. Math. 160(10\u201311), 1547\u20131560 (2012).","journal-title":"Discret. Appl. Math."},{"key":"966_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-13013-7_22","volume-title":"Public Key Cryptography: PKC","author":"SD Galbraith","year":"2010","unstructured":"Galbraith S.D., Ruprai R.S.: Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval. In: Nguyen P.Q., Pointcheval D. (eds.) Public Key Cryptography: PKC, vol. 6056, pp. 368\u2013383. Lecture Notes in Computer Science. Springer, New York (2010)."},{"issue":"282","key":"966_CR12","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1090\/S0025-5718-2012-02641-X","volume":"82","author":"S Galbraith","year":"2013","unstructured":"Galbraith S., Pollard J., Ruprai R.: Computing discrete logarithms in an interval. Math. Comput. 82(282), 1181\u20131195 (2013).","journal-title":"Math. Comput."},{"key":"966_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology: CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant R.P., Lambert R.J., Vanstone S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian J. (ed.) Advances in Cryptology: CRYPTO 2001, pp. 190\u2013200. Springer, Berlin (2001)."},{"doi-asserted-by":"crossref","unstructured":"Gaudry P., Schost \u00c9.: A low-memory parallel version of matsuo, chao, and tsujii\u2019s algorithm. In: International Algorithmic Number Theory Symposium, pp. 208\u2013222. Springer, New York (2004).","key":"966_CR14","DOI":"10.1007\/978-3-540-24847-7_15"},{"key":"966_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/10722028_18","volume-title":"ANTS-IV","author":"P Gaudry","year":"2000","unstructured":"Gaudry P., Harley R.: Counting points on hyperelliptic curves over finite fields. In: Bosma W. (ed.) ANTS-IV, vol. 1838, pp. 313\u2013332. Lecture Notes in Computer Science. Springer, New York (2000)."},{"issue":"1","key":"966_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson D., Menezes A., Vanstone S.: The elliptic curve digital signature algorithm (ecdsa). Int. J. Inf. Secur. 1(1), 36\u201363 (2001).","journal-title":"Int. J. Inf. Secur."},{"key":"966_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/3-540-45455-1_36","volume-title":"ANTS-V","author":"K Matsuo","year":"2002","unstructured":"Matsuo K., Chao J., Tsujii S.: An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields. In: Fieker C., Kohel D.R. (eds.) ANTS-V, vol. 2369, pp. 461\u2013474. Lecture Notes in Computer Science. Springer, New York (2002)."},{"issue":"2","key":"966_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4213\/mvk144","volume":"6","author":"MV Nikolaev","year":"2015","unstructured":"Nikolaev M.V.: On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with efficient automorphism. Math. Voprosy Kriptogr. 6(2), 45\u201357 (2015).","journal-title":"Math. Voprosy Kriptogr."},{"issue":"2","key":"966_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.4213\/mvk326","volume":"11","author":"MV Nikolaev","year":"2020","unstructured":"Nikolaev M.V.: Modified Gaudry Schost algorithm for the two-dimensional discrete logarithm problem. Math. Voprosy Kriptogr. 11(2), 125\u2013135 (2020).","journal-title":"Math. Voprosy Kriptogr."},{"issue":"143","key":"966_CR20","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard J.M.: Monte Carlo methods for index computation(mod p). Math. Comput. 32(143), 918\u2013924 (1978).","journal-title":"Math. Comput."},{"unstructured":"Ruprai R.: Improvements to the Gaudry\u2013Schost Algorithm for Multidimensional Discrete Logarithm Problems and Applications. Ph.D. thesis, Royal Holloway University of London (2010).","key":"966_CR21"},{"doi-asserted-by":"crossref","unstructured":"Schnorr C.P.: Efficient identification and signatures for smart cards. In: Conference on the Theory and Application of Cryptology, pp. 239\u2013252. Springer, New York (1989).","key":"966_CR22","DOI":"10.1007\/0-387-34805-0_22"},{"issue":"1","key":"966_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/dma.1995.5.1.73","volume":"5","author":"BI Selivanov","year":"1995","unstructured":"Selivanov B.I.: On waiting time in the scheme of random allocation of coloured particies. Discret. Math. Appl. 5(1), 73\u201382 (1995).","journal-title":"Discret. Math. Appl."},{"key":"966_CR24","first-page":"41","volume":"20","author":"D Shanks","year":"1971","unstructured":"Shanks D.: Class number, a theory of factorization, and genera. Proc. Symp. Math. Soc. 20, 41\u2013440 (1971).","journal-title":"Proc. Symp. Math. Soc."},{"issue":"1","key":"966_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Van Oorschot","year":"1999","unstructured":"Van Oorschot P.C., Wiener M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999).","journal-title":"J. Cryptol."},{"issue":"5","key":"966_CR26","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s10623-018-0492-3","volume":"87","author":"Y Zhu","year":"2019","unstructured":"Zhu Y., Zhuang J., Yi H., Lv C., Lin D.: A variant of the Galbraith\u2013Ruprai algorithm for discrete logarithms with improved complexity. Des. Codes Cryptogr. 87(5), 971\u2013986 (2019).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00966-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00966-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00966-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T07:17:25Z","timestamp":1641453445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00966-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,29]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["966"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00966-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,10,29]]},"assertion":[{"value":"7 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}