{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T04:52:31Z","timestamp":1758862351525,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346201"},{"type":"electronic","value":"9783030346218"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34621-8_11","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:14:54Z","timestamp":1574381694000},"page":"293-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion"],"prefix":"10.1007","author":[{"given":"Salim Ali","family":"Altu\u011f","sequence":"first","affiliation":[]},{"given":"Yilei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"JA Buchmann","year":"1988","unstructured":"Buchmann, J.A., Williams, H.C.: A key-exchange system based on imaginary quadratic fields. J. Cryptology 1(2), 107\u2013118 (1988)","journal-title":"J. Cryptology"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2009","unstructured":"Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic hash functions from expander graphs. J. Cryptology 22(1), 93\u2013113 (2009)","journal-title":"J. Cryptology"},{"key":"11_CR5","series-title":"Graduate Texts in Mathematics","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":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/978-3-662-02945-9"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006)","key":"11_CR7"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-58691-1_42","volume-title":"Algorithmic Number Theory","author":"J-M Couveignes","year":"1994","unstructured":"Couveignes, J.-M., Morain, F.: Schoof\u2019s algorithm and isogeny cycles. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 43\u201358. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58691-1_42"},{"key":"11_CR9","volume-title":"Primes of the Form $$x^2+ ny^2$$: Fermat, Class Field Theory, and Complex Multiplication","author":"DA Cox","year":"2011","unstructured":"Cox, D.A.: Primes of the Form $$x^2+ ny^2$$: Fermat, Class Field Theory, and Complex Multiplication, vol. 34. Wiley, Hoboken (2011)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-48285-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"N Demytko","year":"1994","unstructured":"Demytko, N.: A new elliptic curve based analogue of RSA. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 40\u201349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_4"},{"issue":"6","key":"11_CR11","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.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/amsip\/007\/03","volume":"7","author":"ND Elkies","year":"1998","unstructured":"Elkies, N.D., et al.: Elliptic and modular curves over finite fields and related computational issues. AMS IP Stud. Adv. Math. 7, 21\u201376 (1998)","journal-title":"AMS IP Stud. Adv. Math."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-14518-6_14","volume-title":"Algorithmic Number Theory","author":"A Enge","year":"2010","unstructured":"Enge, A., Sutherland, A.V.: Class invariants by the CRT method. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 142\u2013156. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_14"},{"unstructured":"De Feo, L.: Mathematics of isogeny based cryptography. arXiv preprint arXiv:1711.04062 (2017)","key":"11_CR14"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-45455-1_23","volume-title":"Algorithmic Number Theory","author":"M Fouquet","year":"2002","unstructured":"Fouquet, M., Morain, F.: Isogeny volcanoes and the SEA algorithm. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 276\u2013291. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_23"},{"doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS, pp. 40\u201349. IEEE Computer Society (2013)","key":"11_CR16","DOI":"10.1109\/FOCS.2013.13"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","key":"11_CR17","DOI":"10.1145\/1374376.1374407"},{"unstructured":"Hohenberger, S.R.: The cryptographic impact of groups with infeasible inversion. Master\u2019s thesis, Massachusetts Institute of Technology (2003)","key":"11_CR18"},{"issue":"281","key":"11_CR19","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1090\/S0025-5718-2012-02622-6","volume":"82","author":"S Ionica","year":"2013","unstructured":"Ionica, S., Joux, A.: Pairing the volcano. Math. Comput. 82(281), 581\u2013603 (2013)","journal-title":"Math. Comput."},{"unstructured":"Irrer, J., Lokam, S., Opyrchal, L., Prakash, A.: Infeasible group inversion and broadcast encryption. University of Michigan Electrical Engineering and Computer Science Tech Note CSE-TR-485-04 (2004)","key":"11_CR20"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"issue":"177","key":"11_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"unstructured":"Kohel, D.R.: Endomorphism rings of elliptic curves over finite fields. PhD thesis, University of California, Berkeley (1996)","key":"11_CR23"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0054116","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"N Kunihiro","year":"1998","unstructured":"Kunihiro, N., Koyama, K.: Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 47\u201358. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054116"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-58691-1_64","volume-title":"Algorithmic Number Theory","author":"G-J Lay","year":"1994","unstructured":"Lay, G.-J., Zimmer, H.G.: Constructing elliptic curves with given group order over large finite fields. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 250\u2013263. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58691-1_64"},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987)","journal-title":"Ann. Math."},{"unstructured":"McCurley, K.S.: Cryptographic key distribution and computation in class groups. IBM Thomas J. Watson Research Division (1988)","key":"11_CR28"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"unstructured":"Molnar, D.: Homomorphic signature schemes. B.s. thesis, Harvard College (2003)","key":"11_CR30"},{"unstructured":"Alexander Rostovtsev and Anton Stolbunov. Public-key cryptosystem based on isogenies. Cryptology ePrint Archive, Report 2006\/145 (2006)","key":"11_CR31"},{"issue":"170","key":"11_CR32","first-page":"483","volume":"44","author":"R Schoof","year":"1985","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput. 44(170), 483\u2013494 (1985)","journal-title":"Math. Comput."},{"issue":"1","key":"11_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux 7(1), 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"11_CR34","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. GTM, vol. 106. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6"},{"key":"11_CR35","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0851-8","volume-title":"Advanced Topics in the Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2013","unstructured":"Silverman, J.H.: Advanced Topics in the Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 151. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4612-0851-8"},{"unstructured":"Sutherland, A.V.: Isogeny kernels and division polynomials. https:\/\/ocw.mit.edu\/courses\/mathematics\/18-783-elliptic-curves-spring-2017\/lecture-notes\/MIT18_783S17_lec6.pdf. Accessed 03 Sept 2018","key":"11_CR36"},{"issue":"1","key":"11_CR37","doi-asserted-by":"publisher","first-page":"507","DOI":"10.2140\/obs.2013.1.507","volume":"1","author":"AV Sutherland","year":"2013","unstructured":"Sutherland, A.V.: Isogeny volcanoes. Open Book Ser. 1(1), 507\u2013530 (2013)","journal-title":"Open Book Ser."},{"issue":"2","key":"11_CR38","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J Tate","year":"1966","unstructured":"Tate, J.: Endomorphisms of abelian varieties over finite fields. Inventiones Math. 2(2), 134\u2013144 (1966)","journal-title":"Inventiones Math."},{"key":"11_CR39","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris 273, 238\u2013241 (1971)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-44381-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"T Yamakawa","year":"2014","unstructured":"Yamakawa, T., Yamada, S., Hanaoka, G., Kunihiro, N.: Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 90\u2013107. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34621-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:37:29Z","timestamp":1710261449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34621-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346201","9783030346218"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34621-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kobe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IACR Web submission software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"307","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}