{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:56:30Z","timestamp":1770814590979,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032163417","type":"print"},{"value":"9783032163424","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-032-16342-4_4","type":"book-chapter","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T08:57:53Z","timestamp":1770800273000},"page":"58-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Perspective on\u00a0the\u00a0Decomposition in\u00a0the\u00a0Jacobian of\u00a0Small Genus Hyperelliptic Curve"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Bhati","sequence":"first","affiliation":[]},{"given":"Shashank","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,12]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_6"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 31\u201355. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_2"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"P Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19\u201334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_2"},{"issue":"257","key":"4_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76(257), 475\u2013492 (2007)","journal-title":"Math. Comput."},{"issue":"1","key":"4_CR5","first-page":"1","volume":"1","author":"A Guillevic","year":"2021","unstructured":"Guillevic, A., Singh, S.: On the alpha value of polynomials in the tower number field sieve algorithm. Math. Cryptol. 1(1), 1\u201339 (2021)","journal-title":"Math. Cryptol."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-29011-4_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Joux","year":"2012","unstructured":"Joux, A., Vitse, V.: Cover and decomposition index calculus on elliptic curves made practical. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 9\u201326. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_3"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"4_CR8","unstructured":"Menezes, A., Zuccherato, R., Yi-Hong, W.: An elementary introduction to hyperelliptic curves. Faculty of Mathematics, University of Waterloo (1996)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-56880-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"G De Micheli","year":"2020","unstructured":"De Micheli, G., Gaudry, P., Pierrot, C.: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 32\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_2"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14518-6_23","volume-title":"Algorithmic Number Theory","author":"K Nagao","year":"2010","unstructured":"Nagao, K.: Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 285\u2013300. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_23"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology","author":"AM Odlyzko","year":"1985","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 224\u2013314. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39757-4_20"},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TIT.2016.2528996","volume":"62","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: Fine tuning the function field sieve algorithm for the medium prime case. IEEE Trans. Inf. Theory 62(4), 2233\u20132253 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-49890-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 429\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_17"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10623-016-0184-9","volume":"82","author":"P Sarkar","year":"2017","unstructured":"Sarkar, P., Singh, S.: A new method for decomposition in the Jacobian of small genus hyperelliptic curves. Des. Codes Crypt. 82(3), 601\u2013616 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00200-016-0299-2","volume":"28","author":"P Sarkar","year":"2017","unstructured":"Sarkar, P., Singh, S.: A simple method for obtaining relations among factor basis elements for special hyperelliptic curves. Appl. Algebra Eng. Commun. Comput. 28(2), 109\u2013130 (2017)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.3934\/amc.2019028","volume":"13","author":"P Sarkar","year":"2019","unstructured":"Sarkar, P., Singh, S.: A unified polynomial selection method for the (tower) number field sieve algorithm. Adv. Math. Commun. 13(3), 435\u2013455 (2019)","journal-title":"Adv. Math. Commun."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-40061-5_5","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"N Th\u00e9riault","year":"2003","unstructured":"Th\u00e9riault, N.: Index calculus attack for hyperelliptic curves of small genus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 75\u201392. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_5"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-16342-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T08:57:57Z","timestamp":1770800277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-16342-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032163417","9783032163424"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-16342-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.iitg.ac.in\/space2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}