{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:44:59Z","timestamp":1767321899045,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","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-10536-3_14","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:38Z","timestamp":1767321698000},"page":"369-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-precision PMNS with\u00a0CIOS Reduction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6286-6756","authenticated-orcid":false,"given":"Nicolas","family":"M\u00e9loni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1316-4894","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Palma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-6870","authenticated-orcid":false,"given":"Pascal","family":"V\u00e9ron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"674","DOI":"10.3934\/amc.2022018","volume":"18","author":"JC Bajard","year":"2024","unstructured":"Bajard, J.C., Marrez, J., Plantard, T., V\u00e9ron, P.: On polynomial modular number systems over $$ \\mathbb{Z} \/{p}\\mathbb{Z} $$. Adv. Math. Commun. 18(3), 674\u2013695 (2024). https:\/\/doi.org\/10.3934\/amc.2022018","journal-title":"Adv. Math. Commun."},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Curve25519: New Diffie-Hellman speed records. In: Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer (2006). https:\/\/doi.org\/10.1007\/11745853_14","DOI":"10.1007\/11745853_14"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bos, J., et al.: Crystals - KYBER: A CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Bouvier, C., Imbert, L.: An alternative approach for SIDH arithmetic. In: Garay, J.A. (ed.) Public-Key Cryptography \u2013 PKC 2021, pp. 27\u201344. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_2","DOI":"10.1007\/978-3-030-75245-3_2"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Campos, F., et al.: Optimizations and practicality of high-security CSIDH. IACR Communications in Cryptology (2024). https:\/\/doi.org\/10.62056\/anjbksdja","DOI":"10.62056\/anjbksdja"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Coladon, T., Elbaz-Vincent, P., Hugounenq, C.: MPHELL: a fast and robust library with unified and versatile arithmetics for elliptic curves cryptography. In: ARITH 2021. Transactions on Emerging Topics in Computing, Torino, Italy (2021). https:\/\/doi.org\/10.1109\/ARITH51176.2021.00026","DOI":"10.1109\/ARITH51176.2021.00026"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Didier, L.S., Robert, J.M., Dosso, F.Y., El\u00a0Mrabet, N.: A software comparison of RNS and PMNS . In: 2022 IEEE 29th Symposium on Computer Arithmetic (ARITH), pp. 86\u201393. IEEE Computer Society, Los Alamitos, CA, USA (2022). https:\/\/doi.org\/10.1109\/ARITH54963.2022.00025","DOI":"10.1109\/ARITH54963.2022.00025"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-019-00221-7","volume":"10","author":"L-S Didier","year":"2020","unstructured":"Didier, L.-S., Dosso, F.-Y., V\u00e9ron, P.: Efficient modular operations using the adapted modular number system. J. Cryptogr. Eng. 10(2), 111\u2013133 (2020). https:\/\/doi.org\/10.1007\/s13389-019-00221-7","journal-title":"J. Cryptogr. Eng."},{"key":"14_CR10","unstructured":"Dosso, F.Y., Berzati, A., Mrabet, N.E., Proy, J.: PMNS revisited for consistent redundancy and equality test. Cryptology ePrint Archive, Paper 2023\/1231 (2023). https:\/\/eprint.iacr.org\/2023\/1231"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Duquesne, S., Mrabet, N.E., Gautier, E.: PMNS arithmetic for elliptic curve cryptography. Cryptology ePrint Archive, Paper 2025\/467 (2025). https:\/\/eprint.iacr.org\/2025\/467","DOI":"10.1007\/978-3-031-97260-7_9"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Mrabet, N.E., M\u00e9loni, N., Palma, F., V\u00e9ron, P.: Friendly primes for efficient modular arithmetic using the polynomial modular number system. Cryptology ePrint Archive, Paper 2025\/090 (2025). https:\/\/eprint.iacr.org\/2025\/090","DOI":"10.1007\/s13389-025-00382-8"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/tetc.2022.3187786","volume":"10","author":"FY Dosso","year":"2022","unstructured":"Dosso, F.Y., Robert, J.M., V\u00e9ron, P.: PMNS for efficient arithmetic and small memory cost. IEEE Trans. Emerg. Top. Comput. 10(3), 1263\u20131277 (2022). https:\/\/doi.org\/10.1109\/tetc.2022.3187786","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"14_CR14","unstructured":"van Emde\u00a0Boas, P.: Another np-complete problem and the complexity of computing short vectors in a lattice. Tech. Rep. 81-04, University of Amsterdam, Department of Mathematics, Netherlands (1981)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1109\/TC.2012.95","volume":"62","author":"MA Hasan","year":"2013","unstructured":"Hasan, M.A., N\u00e8gre, C.: Multiway splitting method for toeplitz matrix vector product. IEEE Trans. Comput. 62, 1467\u20131471 (2013). https:\/\/doi.org\/10.1109\/TC.2012.95","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C Kaya Koc","year":"1996","unstructured":"Kaya Koc, C., Acar, T., Kaliski, B.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996). https:\/\/doi.org\/10.1109\/40.502403","journal-title":"IEEE Micro"},{"key":"14_CR17","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, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Mankowski, D., Wiggers, T., Moonsamy, V.: TLS post-quantum TLS: inspecting the TLS landscape for PQC adoption on android . In: 2023 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp. 526\u2013538. IEEE Computer Society, Los Alamitos, CA, USA (2023). https:\/\/doi.org\/10.1109\/EuroSPW59978.2023.00065, https:\/\/doi.ieeecomputersociety.org\/10.1109\/EuroSPW59978.2023.00065","DOI":"10.1109\/EuroSPW59978.2023.00065"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"M\u00e9loni, N., Palma, F., V\u00e9ron, P.: PMNS for cryptography : a guided tour. Advances in mathematics of communications, pp. 342\u2013359 (2023). https:\/\/doi.org\/10.3934\/amc.2023033","DOI":"10.3934\/amc.2023033"},{"key":"14_CR20","unstructured":"Minkowski, H.: Zur Geometrie der Zahlen. Teubner, Leipzig (1905)"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-lattice-based key-encapsulation mechanism standard. Tech. Rep. Federal Information Processing Standards Publications (FIPS) 203, U.S. Department of Commerce, Washington, D.C. (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.203","DOI":"10.6028\/NIST.FIPS.203"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Negre, C., Plantard, T.: Efficient modular arithmetic in adapted modular number system using lagrange representation. In: Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, pp. 463\u2013477 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_34","DOI":"10.1007\/978-3-540-70500-0_34"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Lll on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory, pp. 238\u2013256. Springer Berlin Heidelberg, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_18","DOI":"10.1007\/11792086_18"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Noyez, L., El\u00a0Mrabet, N., Potin, O., V\u00e9ron, P.: Modular multiplication in the AMNS representation: hardware implementation. In: Selected Areas in Cryptography. Montr\u00e9al (Qu\u00e9bec), France (2024). https:\/\/hal.science\/hal-04691484, to appear in LNCS vol 15516","DOI":"10.1007\/978-3-031-82841-6_11"},{"key":"14_CR25","unstructured":"Paoloni, G.: White paper: how to benchmark code execution times on intel\u00ae IA-32 and IA-64 instruction set architectures. intel corporation, Tech. rep. (2010)"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 68\u201385. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_51","DOI":"10.1007\/3-540-54458-5_51"},{"key":"14_CR27","unstructured":"Westerbaan, B.: The state of the post-quantum internet (2024). https:\/\/blog.cloudflare.com\/pq-2024\/. Accessed 23 Oct 2024"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:40Z","timestamp":1767321700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_14","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}