{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T04:00:54Z","timestamp":1780200054384,"version":"3.54.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032275738","type":"print"},{"value":"9783032275745","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-27574-5_16","type":"book-chapter","created":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:05:39Z","timestamp":1780196739000},"page":"253-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equality Tests in\u00a0the\u00a0Polynomial Modular Number System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6286-6756","authenticated-orcid":false,"given":"Nicolas","family":"M\u00e9loni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1316-4894","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Palma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-6870","authenticated-orcid":false,"given":"Pascal","family":"V\u00e9ron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Bajard, J.C., Marrez, J., Plantard, T., V\u00e9ron, P.: On polynomial modular number systems over Z\/pZ. Adv. Math. Commun. 18(3), 674\u2013695 (2024). https:\/\/doi.org\/10.3934\/amc.2022018. URL: https:\/\/hal.science\/hal-03611829","DOI":"10.3934\/amc.2022018"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-75245-3_2","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"C Bouvier","year":"2021","unstructured":"Bouvier, C., Imbert, L.: An alternative approach for SIDH arithmetic. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 27\u201344. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_2"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, vol. 138. Graduate Texts in Mathematics. Springer, Heidelberg (1993)","DOI":"10.1007\/978-3-662-02945-9"},{"key":"16_CR4","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: 28th IEEE Symposium on Computer Arithmetic, ARITH 2021, Lyngby, Denmark, 14\u201316 June 2021, pp. 78\u2013 85. IEEE (2021). https:\/\/doi.org\/10.1109\/ARITH51176.2021.0002","DOI":"10.1109\/ARITH51176.2021.0002"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Didier, L.-S., Dosso, F.Y., V\u00e9ron, P.: Efficient modular operations using the Adapted Modular Number System. J. Crypto. Eng. 1\u201323 (2020)","DOI":"10.1007\/s13389-019-00221-7"},{"key":"16_CR6","volume-title":"Contribution de l\u2019arithm\u00e9tique des ordinateurs aux impl\u00e9mentations r\u00e9sistantes aux attaques par canaux auxiliaires","author":"Fangan Yssouf Dosso","year":"2020","unstructured":"Fangan Yssouf Dosso: Contribution de l\u2019arithm\u00e9tique des ordinateurs aux impl\u00e9mentations r\u00e9sistantes aux attaques par canaux auxiliaires. Universit\u00e9 de Toulon, Theses (2020)"},{"key":"16_CR7","unstructured":"Dosso, F.Y., Berzati, A., El Mrabet, N., Proy, J.: Redundancy and equality test in the PMNS, application to Elliptic Curve Diffie\u2013Hellman. Cryptology ePrint Archive, Paper 2023\/1231 (2023). https:\/\/eprint.iacr.org\/2023\/1231"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Duquesne, S., El Mrabet, N., 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":"16_CR9","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., El Mrabet, N., 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"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Robert, J.M., V\u00e9ron, P.: PMNS for efficient arithmetic and small memory cost. IEEE Trans. Emerg. Topics Comput. 10(3), 1263\u20131277 (2022). https:\/\/hal.science\/hal-03768546v1\/file\/TETC3187786.pdf","DOI":"10.1109\/TETC.2022.3187786"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Hermite, C.: Sur l\u2019introduction des variables continues dans la th\u00e9orie des nombres. fre. J. f\u00fcr die reine und angewandte Mathematik 41, 191\u2013216 (1851)","DOI":"10.1515\/crll.1851.41.191"},{"key":"16_CR13","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)","journal-title":"Math. Ann."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"M\u00e9loni, N., Palma, F., V\u00e9ron, P.: Multi-precision PMNS with CIOS reduction. In: Selected Areas in Cryptography. Springer, Toronto (2025). https:\/\/hal.science\/hal-05144945","DOI":"10.1007\/978-3-032-10536-3_14"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"M\u00e9loni, N., Palma, F., V\u00e9ron, P.: PMNS for cryptography: a guided tour. Adv. Math. Commun. (2023). https:\/\/doi.org\/10.3934\/amc.2023033. https:\/\/hal.science\/hal-04195613","DOI":"10.3934\/amc.2023033"},{"issue":"170","key":"16_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology. Digital Signature Standard (DSS). FIPS PUB 186-4. NIST (2013). https:\/\/doi.org\/10.6028\/NIST.FIPS.186-4","DOI":"10.6028\/NIST.FIPS.186-4"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology. Module-Lattice-Based Key- Encapsulation Mechanism Standard. Technical report. 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":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-70500-0_34","volume-title":"Information Security and Privacy","author":"C Negre","year":"2008","unstructured":"Negre, C., Plantard, T.: Efficient modular arithmetic in adapted modular number system using lagrange representation. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 463\u2013477. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_34"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Noyez, L., El Mrabet, 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)","DOI":"10.1007\/978-3-031-82841-6_11"},{"key":"16_CR21","unstructured":"OpenSSL (1998). https:\/\/www.openssl.org\/. Accessed 07 July 2022"},{"key":"16_CR22","unstructured":"Paoloni, G.: White paper: How to Benchmark Code Execution Times on Intel\u00ae IA-32 and IA-64 Instruction Set Architectures. Intel Corporation, Technical report (2010)"},{"issue":"3","key":"16_CR23","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1109\/TETC.2021.3073475","volume":"9","author":"T Plantard","year":"2021","unstructured":"Plantard, T.: Efficient word size modular arithmetic. IEEE Trans. Emerg. Top. Comput. 9(3), 1506\u20131518 (2021). https:\/\/doi.org\/10.1109\/TETC.2021.3073475","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C-P Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. In: International Symposium on Fundamentals of Computation Theory, pp. 68\u201385. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54458-5_51"},{"key":"16_CR26","first-page":"293","volume":"151","author":"HJS Smith","year":"1861","unstructured":"Smith, H.J.S.: On systems of linear indeterminate equations and congruences. Phil. Trans. R. Soc. Lond. 151, 293\u2013326 (1861)","journal-title":"Phil. Trans. R. Soc. Lond."},{"key":"16_CR27","unstructured":"The GNU Multiple Precision Arithmetic Library (GMP) (1991). https:\/\/gmplib.org\/. Accessed 07 July 2022"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27574-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:05:44Z","timestamp":1780196744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27574-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032275738","9783032275745"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27574-5_16","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":"31 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santander","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.waifi.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}