{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:43:55Z","timestamp":1757627035873,"version":"3.44.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031944475"},{"type":"electronic","value":"9783031944482"}],"license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-94448-2_14","type":"book-chapter","created":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T19:08:13Z","timestamp":1756667293000},"page":"269-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamically Expanding Factor Base of\u00a0Index Calculus Algorithm to\u00a0Solve Massive Discrete Logarithm Problems Faster"],"prefix":"10.1007","author":[{"given":"Yichen","family":"Hao","sequence":"first","affiliation":[]},{"given":"Wen","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhishuo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weixin","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yongjian","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Adleman, L.M., Huang, M.D.A.: Function field sieve method for discrete logarithms over finite fields. Inf. Comput. 151(1), 5\u201316 (1999). https:\/\/doi.org\/10.1006\/inco.1998.2761. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540198927614","key":"14_CR1","DOI":"10.1006\/inco.1998.2761"},{"unstructured":"Bai, S., Brent, R.P., et\u00a0al.: On the efficiency of Pollard\u2019s rho method for discrete logarithms. In: CATS, vol.\u00a08, pp. 125\u2013131 (2008)","key":"14_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bernstein, D., Lange, T.: Two grumpy giants and a baby. In: The Open Book Series, vol. 1, no. 1, pp. 87\u2013111 (2013). https:\/\/doi.org\/10.2140\/obs.2013.1.87","key":"14_CR3","DOI":"10.2140\/obs.2013.1.87"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) Theory of Cryptography, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"RP Brent","year":"1980","unstructured":"Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT Numer. Math. 20(2), 176\u2013184 (1980)","journal-title":"BIT Numer. Math."},{"doi-asserted-by":"publisher","unstructured":"Chateauneuf, M., Ling, A.C.H., Stinson, D.R.: Slope packings and coverings, and generic algorithms for the discrete logarithm problem. J. Comb. Des. 11(1), 36\u201350 (2003). https:\/\/doi.org\/10.1002\/jcd.10033. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/jcd.10033","key":"14_CR6","DOI":"10.1002\/jcd.10033"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inf. Theor. 30(4), 587\u2013594 (1984). https:\/\/doi.org\/10.1109\/TIT.1984.1056941","journal-title":"IEEE Trans. Inf. Theor."},{"doi-asserted-by":"publisher","unstructured":"Coppersmith, D., Odlzyko, A.M., Schroeppel, R.: Discrete logarithms in GF(P). Algorithmica 1(1\u20134), 1\u201315 (1986). https:\/\/doi.org\/10.1007\/BF01840433","key":"14_CR8","DOI":"10.1007\/BF01840433"},{"key":"14_CR9","first-page":"415","volume-title":"Advances in Cryptology","author":"H Corrigan-Gibbs","year":"2018","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The discrete-logarithm problem with preprocessing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, pp. 415\u2013447. Springer, Cham (2018)"},{"issue":"6","key":"14_CR10","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. Theor. 22(6), 644\u2013654 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055638","journal-title":"IEEE Trans. Inf. Theor."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology, pp. 10\u201318. Springer, Heidelberg (1985)"},{"doi-asserted-by":"publisher","unstructured":"Gordon, D.M.: Discrete logarithms in GF(P) using the number field sieve. SIAM J. Discrete Math. 6(1), 124\u2013138 (1993). https:\/\/doi.org\/10.1137\/0406010","key":"14_CR12","DOI":"10.1137\/0406010"},{"doi-asserted-by":"publisher","unstructured":"Nivasch, G.: Cycle detection using a stack. Inf. Process. Lett. 90(3), 135\u2013140 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2004.01.016. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019004000419","key":"14_CR13","DOI":"10.1016\/j.ipl.2004.01.016"},{"doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) Advances in Cryptology, pp. 224\u2013314. Springer, Heidelberg (1985)","key":"14_CR14","DOI":"10.1007\/3-540-39757-4_20"},{"doi-asserted-by":"publisher","unstructured":"Padmavathy, R., Bhagvati, C.: Discrete logarithm problem using index calculus method. Math. Comput. Model. 55(1), 161\u2013169 (2012). Advanced Theory and Practice for Cryptography and Future Security. https:\/\/doi.org\/10.1016\/j.mcm.2011.02.022. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0895717711001129","key":"14_CR15","DOI":"10.1016\/j.mcm.2011.02.022"},{"doi-asserted-by":"publisher","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(P) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theor. 24(1), 106\u2013110 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055817","key":"14_CR16","DOI":"10.1109\/TIT.1978.1055817"},{"doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comput. 32, 918\u2013924 (1978). https:\/\/api.semanticscholar.org\/CorpusID:51748214","key":"14_CR17","DOI":"10.1090\/S0025-5718-1978-0491431-9"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201989","author":"JJ Quisquater","year":"1990","unstructured":"Quisquater, J.J., Delescaille, J.P.: How easy is collision search? Application to DES. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology \u2013 EUROCRYPT \u201989, pp. 429\u2013434. Springer, Heidelberg (1990)"},{"issue":"65\u201379","key":"14_CR19","first-page":"106","volume":"6","author":"J Sattler","year":"1985","unstructured":"Sattler, J., Schnorr, C.P.: Generating random walks in groups. Ann. Univ. Sci. Budapest. Sect. Comput 6(65\u201379), 106 (1985)","journal-title":"Ann. Univ. Sci. Budapest. Sect. Comput"},{"doi-asserted-by":"publisher","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Proceedings of Symposia in Pure Mathematics, pp. 415\u2013440 (1971). https:\/\/doi.org\/10.1090\/pspum\/020\/0316385","key":"14_CR20","DOI":"10.1090\/pspum\/020\/0316385"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008319518035","volume":"20","author":"JH Silverman","year":"2000","unstructured":"Silverman, J.H.: The Xedni calculus and the elliptic curve discrete logarithm problem. Des. Codes Crypt. 20(1), 5\u201340 (2000). https:\/\/doi.org\/10.1023\/A:1008319518035","journal-title":"Des. Codes Crypt."},{"unstructured":"Stein, A., Teske, E.: Optimized baby step-giant step methods. J. Ramanujan Math. Soc. 20(1), 1\u201332 (2005). https:\/\/api.semanticscholar.org\/CorpusID:122442192","key":"14_CR22"},{"unstructured":"Sutherland, A.: Index calculus, smooth numbers, and factoring integers. Website (2023). https:\/\/math.mit.edu\/classes\/18.783\/2015\/LectureNotes11.pdf","key":"14_CR23"},{"doi-asserted-by":"crossref","unstructured":"Teske, E.: Speeding up Pollard\u2019s rho method for computing discrete logarithms. Springer (1998)","key":"14_CR24","DOI":"10.1007\/BFb0054891"},{"doi-asserted-by":"publisher","unstructured":"Teske, E.: The Pohlig\u2013Hellman method generalized for group structure computation. J. Symbolic Comput. 27(6), 521\u2013 534 (1999). https:\/\/doi.org\/10.1006\/jsco.1999.0279. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717199902791","key":"14_CR25","DOI":"10.1006\/jsco.1999.0279"},{"key":"14_CR26","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\u201328 (1999)","journal-title":"J. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Vu, D.H.: Privacy-preserving Naive Bayes classification in semifully distributed data model. Comput. Secur. 115, 102630 (2022). https:\/\/doi.org\/10.1016\/j.cose.2022.102630. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167404822000293","key":"14_CR27","DOI":"10.1016\/j.cose.2022.102630"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-94448-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:14:59Z","timestamp":1757463299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94448-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"ISBN":["9783031944475","9783031944482"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94448-2_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"assertion":[{"value":"1 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}