{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:40:10Z","timestamp":1746600010126,"version":"3.40.5"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918193","type":"print"},{"value":"9783031918209","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91820-9_3","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:01:10Z","timestamp":1746597670000},"page":"67-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Higher Residuosity Attacks on\u00a0Small RSA Subgroup Decision Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1838-6471","authenticated-orcid":false,"given":"Xiaopeng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5250-5030","authenticated-orcid":false,"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7441-2954","authenticated-orcid":false,"given":"Zhusen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/S00145-016-9229-5","volume":"30","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Herranz, J., Joye, M., Libert, B.: Efficient cryptosystems from $${2}^{k}$$-th power residue symbols. J. Cryptol. 30(2), 519\u2013549 (2017). https:\/\/doi.org\/10.1007\/S00145-016-9229-5","journal-title":"J. Cryptol."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11889663_18","volume-title":"Financial Cryptography and Data Security","author":"IF Blake","year":"2006","unstructured":"Blake, I.F., Kolesnikov, V.: Conditional encrypted mapping and comparing encrypted numbers. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 206\u2013220. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_18"},{"key":"3_CR3","unstructured":"de\u00a0Boer, K.: Computing the power residue symbol. Master\u2019s thesis. Nijmegen, Radboud University (2016). www.koendeboer.com"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-030-40186-3_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"F Bourse","year":"2020","unstructured":"Bourse, F., Sanders, O., Traor\u00e9, J.: Improved secure integer comparison via homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 391\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_17"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1515\/jmc-2019-0035","volume":"14","author":"\u00c9 Brier","year":"2020","unstructured":"Brier, \u00c9., Ferradi, H., Joye, M., Naccache, D.: New number-theoretic cryptographic primitives. J. Math. Cryptol. 14(1), 224\u2013235 (2020)","journal-title":"J. Math. Cryptol."},{"key":"3_CR6","unstructured":"Brier, E., Naccache, D.: The thirteenth power residue symbol. IACR Cryptol. ePrint Arch. 2019, 1176 (2019). https:\/\/eprint.iacr.org\/2019\/1176"},{"issue":"08","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1142\/S1793042110003770","volume":"6","author":"PC Caranay","year":"2010","unstructured":"Caranay, P.C., Scheidler, R.: An efficient seventh power residue symbol algorithm. Int. J. Number Theory 6(08), 1831\u20131853 (2010)","journal-title":"Int. J. Number Theory"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Carlton, R., Essex, A., Kapulkin, K.: Threshold properties of prime power subgroups with application to secure integer comparisons. In: Topics in Cryptology - CT-RSA 2018 - The Cryptographers\u2019 Track at the RSA Conference. LNCS, vol. 10808, pp. 137\u2013156. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_8","DOI":"10.1007\/978-3-319-76953-0_8"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"2013","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, vol. 138. Springer Science & Business Media, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-02945-9"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.jsc.2004.02.006","volume":"39","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Frandsen, G.S.: Efficient algorithms for the GCD and cubic residuosity in the ring of eisenstein integers. J. Symb. Comput. 39(6), 643\u2013652 (2005). https:\/\/doi.org\/10.1016\/j.jsc.2004.02.006","journal-title":"J. Symb. Comput."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-73458-1_30","volume-title":"Information Security and Privacy","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 416\u2013430. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_30"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: A correction to efficient and secure comparison for on-line auctions. Int. J. Appl. Cryptogr. 1(4), 323\u2013324 (2009). https:\/\/doi.org\/10.1504\/IJACT.2009.028031","DOI":"10.1504\/IJACT.2009.028031"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"M Fischlin","year":"2001","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 457\u2013471. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_33"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Schoenmakers, B., Villegas, J.: Practical and secure solutions for integer comparison. In: Okamoto, T., Wang, X. (eds) Proceedings of 10th International Conference on Practice and Theory in Public-Key Cryptography - PKC 2007. LNCS, vol.\u00a04450, pp. 330\u2013342. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_22","DOI":"10.1007\/978-3-540-71677-8_22"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of 14th Annual ACM Symposium on Theory of Computing, pp. 365\u2013377. ACM Press (1982). https:\/\/doi.org\/10.1145\/800070.802212","DOI":"10.1145\/800070.802212"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-30576-7_4","volume-title":"Theory of Cryptography","author":"J Groth","year":"2005","unstructured":"Groth, J.: Cryptography in subgroups of $$\\mathbb{Z}_{n}^{*}$$. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 50\u201365. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_4"},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/b14968","volume-title":"Quadratic Irrationals: An Introduction to Classical Number Theory","author":"F Halter-Koch","year":"2013","unstructured":"Halter-Koch, F.: Quadratic Irrationals: An Introduction to Classical Number Theory. CRC Press, New York (2013)"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Hilbert, D.: The theory of algebraic number fields. Springer Science & Business Media, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-662-03545-0","DOI":"10.1007\/978-3-662-03545-0"},{"key":"3_CR19","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","first-page":"A Classical Int","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A Classical Introduction to Modern Number Theory","author":"K Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. GTM, vol. 84, p. A Classical Introduction to Modern Number Theory. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4757-2103-4"},{"key":"3_CR20","unstructured":"Joye, M.: Evaluating octic residue symbols. IACR Cryptol. ePrint Arch., 1196 (2019). https:\/\/eprint.iacr.org\/2019\/1196"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1515\/jmc-2020-0077","volume":"15","author":"M Joye","year":"2021","unstructured":"Joye, M., Lapiha, O., Nguyen, K., Naccache, D.: The eleventh power residue symbol. J. Math. Cryptol. 15(1), 111\u2013122 (2021). https:\/\/doi.org\/10.1515\/jmc-2020-0077","journal-title":"J. Math. Cryptol."},{"key":"3_CR22","first-page":"385","volume":"13","author":"F Lemmermeyer","year":"1995","unstructured":"Lemmermeyer, F.: The Euclidean algorithm in algebraic number fields. Expo. Math. 13, 385\u2013416 (1995)","journal-title":"Expo. Math."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Lemmermeyer, F.: Reciprocity laws: from Euler to Eisenstein. In: Sasaki, C., Sugiura, M., Dauben, J.W. (eds) The Intersection of History and Mathematics. Science Networks \u00b7 Historical Studies, vol 15. Springer Science & Business Media, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-0348-7521-9_6","DOI":"10.1007\/978-3-0348-7521-9_6"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1112\/jlms\/s2-10.4.457","volume":"10","author":"HW Lenstra","year":"1975","unstructured":"Lenstra, H.W.: Euclid\u2019s algorithm in cyclotomic fields. J. London Math. Soc. 10, 457\u2013465 (1975)","journal-title":"J. London Math. Soc."},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Lin, H., Tzeng, W.: An efficient solution to the millionaires\u2019 problem based on homomorphic encryption. In: Ioannidis, J., Keromytis, A., Yung, M. (eds) Proceedings of 3rd International Conference on Applied Cryptography and Network Security - ACNS 2005. LNCS, vol.\u00a03531, pp. 456\u2013466. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_31","DOI":"10.1007\/11496137_31"},{"key":"3_CR26","unstructured":"McKenzie, R.G.: The ring of cyclotomic integers of modulus thirteen is norm-Euclidean. Ph.D. thesis, Michigan State University (1988)"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00145-010-9070-1","volume":"24","author":"J Monnerat","year":"2011","unstructured":"Monnerat, J., Vaudenay, S.: Short undeniable signatures based on group homomorphisms. J. Cryptol. 24, 545\u2013587 (2011)","journal-title":"J. Cryptol."},{"key":"3_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03983-0","volume-title":"Algebraic Number Theory","author":"J Neukirch","year":"2013","unstructured":"Neukirch, J.: Algebraic Number Theory, vol. 322. Springer Science & Business Media, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-03983-0"},{"key":"3_CR29","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report (1979)"},{"issue":"2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01398010","volume":"6","author":"R Scheidler","year":"1995","unstructured":"Scheidler, R., Williams, H.C.: A public-key cryptosystem utilizing cyclotomic fields. Des. Codes Cryptogr. 6(2), 117\u2013131 (1995). https:\/\/doi.org\/10.1007\/BF01398010","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0022-314X(02)92783-6","volume":"96","author":"A Weilert","year":"2002","unstructured":"Weilert, A.: Fast computation of the biquadratic residue symbol. J. Number Theory 96(1), 133\u2013151 (2002)","journal-title":"J. Number Theory"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-39799-X_26","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"HC Williams","year":"1986","unstructured":"Williams, H.C.: An M3 public-key encryption scheme. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 358\u2013368. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_26"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: Proceedings of 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91820-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:01:15Z","timestamp":1746597675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91820-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918193","9783031918209"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91820-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All authors disclosed no relevant relationships.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}