{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:48:28Z","timestamp":1765370908661,"version":"3.46.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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-13301-4_8","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:49Z","timestamp":1765357969000},"page":"173-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Smooth Twins for\u00a0Cryptographic Applications from\u00a0Pell Equations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1987-835X","authenticated-orcid":false,"given":"Daniel","family":"Berger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Basso, A., Maino, L.: POK\u00e9: a compact and efficient PKE from higher-dimensional isogenies. In: Fehr, S., Fouque, P.A. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2025. pp. 94\u2013123. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_4","DOI":"10.1007\/978-3-031-91124-8_4"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., De\u00a0Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. Open Book Series 4(1), 39\u201355 (2020). https:\/\/doi.org\/10.2140\/obs.2020.4.39. https:\/\/msp.org\/obs\/2020\/4-1\/p04.xhtmlSciences Publishers","DOI":"10.2140\/obs.2020.4.39"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bruno, G., Corte-Real\u00a0Santos, M., Costello, C., Eriksen, J.K., Meyer, M., Naehrig, M., Sterner, B.: Cryptographic smooth neighbors. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023, pp. 190\u2013221. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_7","DOI":"10.1007\/978-981-99-8739-9_7"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Buzek, J., Hasan, J., Liu, J., Naehrig, M., Vigil, A.: Finding twin smooth integers by solving Pell equations (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.04315. http:\/\/arxiv.org\/abs\/2211.04315","DOI":"10.48550\/arXiv.2211.04315"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Carmichael, R.D.: On the numerical factors of the arithmetic forms $$\\alpha ^n \\pm \\beta ^n$$. Ann. Math. 15(1\/4), 30\u201348. https:\/\/doi.org\/10.2307\/1967797. https:\/\/www.jstor.org\/stable\/1967797","DOI":"10.2307\/1967797"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 423\u2013447. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Corte-Real\u00a0Santos, M., Eriksen, J.K., Meyer, M., Reijnders, K.: Apr\u00e8sSQI: extra fast verification for SQIsign using extension-field signing. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 63\u201393. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_3","DOI":"10.1007\/978-3-031-58716-0_3"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Costello, C.: B-SIDH: supersingular isogeny diffie-hellman using twisted torsion. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2020, pp. 440\u2013463. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_15","DOI":"10.1007\/978-3-030-64834-3_15"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Costello, C., Meyer, M., Naehrig, M.: Sieving for twin smooth integers with solutions to the prouhet-tarry-escott problem. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2021, pp. 272\u2013301. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_10","DOI":"10.1007\/978-3-030-77870-5_10"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-64837-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Kohel, D., Leroux, A., Petit, C., Wesolowski, B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"De\u00a0Feo, L., Leroux, A., Longa, P., Wesolowski, B.: New algorithms for the deuring correspondence. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. pp. 659\u2013690. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_23","DOI":"10.1007\/978-3-031-30589-4_23"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"de\u00a0Haan, R., Jacobson, M., Williams, H.: A fast, rigorous technique for computing the regulator of a real quadratic field. Math. Comput. 76(260), 2139\u20132160 (Oct 2007). https:\/\/doi.org\/10.1090\/S0025-5718-07-01935-7. https:\/\/www.ams.org\/mcom\/2007-76-260\/S0025-5718-07-01935-7\/","DOI":"10.1090\/S0025-5718-07-01935-7"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Hua, L.k.: On the least solution of Pell\u2019s equation (1942). https:\/\/projecteuclid.org\/journals\/bulletin-of-the-american-mathematical-society\/volume-48\/issue-10\/On-the-least-solution-of-Pells-equation\/bams\/1183504769.pdf","DOI":"10.1090\/S0002-9904-1942-07768-8"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Jacobson, M.J., , Richard\u00a0F., L., , Williams, H.C.: An Investigation of Bounds for the Regulator of Quadratic Fields. Experimental Mathematics 4(3), 211\u2013225 (Jan 1995). https:\/\/doi.org\/10.1080\/10586458.1995.10504322, https:\/\/doi.org\/10.1080\/10586458.1995.10504322, publisher: Taylor $$\\&$$ Francis _eprint: https:\/\/doi.org\/10.1080\/10586458.1995.10504322","DOI":"10.1080\/10586458.1995.10504322"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Jacobson, M.J., Scheidler, R., Williams, H.C.: An improved real-quadratic-field-based key exchange procedure. J. Cryptol. 19(2), 211\u2013239 (2006). https:\/\/doi.org\/10.1007\/s00145-005-0357-6","DOI":"10.1007\/s00145-005-0357-6"},{"key":"8_CR16","unstructured":"Jacobson, M.J., Scheidler, R., Williams, H.C.: The efficiency and security of a real quadratic field based key exchange protocol. In: Public-Key Cryptography and Computational Number Theory, pp. 89\u2013112. De Gruyter (2011). https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/9783110881035.89\/pdf"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Jacobson, M.J., Williams, H.C.: Solving the pell equation. In: CMS Books in Mathematics. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84923-2","DOI":"10.1007\/978-0-387-84923-2"},{"key":"8_CR18","unstructured":"Jacobson\u00a0Jr, M.J., Sawilla, R.E., Williams, H.C.: Efficient ideal reduction in quadratic fields. Int. J. Math. Comput. Sci. 1, 83\u2013116 (2006). https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1&type=pdf &doi=621e8b4d38ed9fe240cd444938c79e161a11fa48"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Khintchine, A.: Zur metrischen Theorie der diophantischen Approximationen. Mathematische Zeitschrift 24(1), 706\u2013714 (1926). https:\/\/doi.org\/10.1007\/BF01216806","DOI":"10.1007\/BF01216806"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Lagarias, J.C.: On the computational complexity of determining the solvability or unsolvability of the equation $$X^2-DY^2=-1$$. Trans. Am. Math. Soc. 260(2), 485\u2013508 (1980). https:\/\/doi.org\/10.1090\/S0002-9947-1980-0574794-0. https:\/\/www.ams.org\/tran\/1980-260-02\/S0002-9947-1980-0574794-0\/","DOI":"10.1090\/S0002-9947-1980-0574794-0"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Lehmer, D.H.: On a problem of St\u00f6rmer. Illinois J. Math. 8(1), 57\u201379 (1964). https:\/\/projecteuclid.org\/journalArticle\/Download?urlId=10.1215%2Fijm%2F1256067456","DOI":"10.1215\/ijm\/1256067456"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Luca, F., Najman, F.: On the largest prime factor of $$x^2 - 1$$. Math. Comput. 80(273), 429\u2013435 (2011). https:\/\/doi.org\/10.1090\/S0025-5718-2010-02381-6. https:\/\/www.ams.org\/mcom\/2011-80-273\/S0025-5718-2010-02381-6\/","DOI":"10.1090\/S0025-5718-2010-02381-6"},{"key":"8_CR23","unstructured":"L\u00e9vy, P.: Sur le d\u00e9veloppement en fraction continue d\u2019un nombre choisi au hasard. Compositio mathematica 3, 286\u2013303"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Santos, M.C.R., Eriksen, J.K., Meyer, M., Rodr\u00edguez-Henr\u00edquez, F.: Finding practical parameters for isogeny-based cryptography (2024). https:\/\/eprint.iacr.org\/2024\/1150","DOI":"10.62056\/ayojbhey6b"},{"key":"8_CR25","unstructured":"Shanks, D.: The infrastructure of a real quadratic field and its applications. In: Proceedings of the Number Theory Conference, pp. 217\u2013224 (1972)"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Sterner, B.: towards optimally small smoothness bounds for cryptographic-sized smooth twins and their isogeny-based applications. In: Eichlseder, M., Gambs, S. (eds.) Selected Areas in Cryptography \u2013 SAC 2024, pp. 178\u2013202. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-82852-2_8","DOI":"10.1007\/978-3-031-82852-2_8"},{"key":"8_CR27","unstructured":"Steuding, J.: Diophantine Analysis. CRC Press, Boca Raton"},{"key":"8_CR28","unstructured":"St\u00f8rmer, C.: Quelques th\u00e9or\u00e8mes sur l\u2019\u00e9quation de Pell et leurs applications (1897)"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Vollmer, U.: An accelerated buchmann algorithm for regulator computation in real quadratic fields. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory, vol.\u00a02369, pp. 148\u2013162. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_12","DOI":"10.1007\/3-540-45455-1_12"},{"key":"8_CR30","unstructured":"V\u00e9lu, J.: Isogenies entre courbes elliptiques. Comptes-Rendus de l\u2019Academie des Sci. 273, 238\u2013241 (1971). https:\/\/cir.nii.ac.jp\/crid\/1573387449093111296"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:54Z","timestamp":1765357974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","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":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}