{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:32:28Z","timestamp":1767339148750,"version":"build-2065373602"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"TPM","award":["AAP2024 - CALVERE","AAP2024 - CALVERE","AAP2024 - CALVERE"],"award-info":[{"award-number":["AAP2024 - CALVERE","AAP2024 - CALVERE","AAP2024 - CALVERE"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s13389-025-00382-8","type":"journal-article","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T15:15:14Z","timestamp":1758899714000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System"],"prefix":"10.1007","volume":"15","author":[{"given":"Fangan Yssouf","family":"Dosso","sequence":"first","affiliation":[]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"M\u00e9loni","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Palma","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"V\u00e9ron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"key":"382_CR1","unstructured":"Sec 2. standards for efficient cryptography group: Recommended elliptic curve domain parameters. Certicom Research (2010)"},{"key":"382_CR2","unstructured":"List of prime numbers - wikipedia (2024), https:\/\/en.wikipedia.org\/wiki\/List_of_prime_numbers#Lists_of_primes_by_type, last accessed 23 Sep 2024"},{"key":"382_CR3","unstructured":"Aranha, D.F., Barreto, P.S.L.M., Pereira, G.C.C.F., Ricardini, J.E.: A note on high-security general-purpose elliptic curves. Cryptology ePrint Archive, Paper 2013\/647 (2013), https:\/\/eprint.iacr.org\/2013\/647"},{"key":"382_CR4","doi-asserted-by":"publisher","unstructured":"Bajard, J.C., Imbert, L., Plantard, T.: Modular number systems: Beyond the mersenne family. In: Selected Areas in Cryptography, 11th International Workshop, SAC 2004, Waterloo, Canada. pp. 159\u2013169 (2004). https:\/\/doi.org\/10.1007\/978-3-540-30564-4_11","DOI":"10.1007\/978-3-540-30564-4_11"},{"issue":"3","key":"382_CR5","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":"382_CR6","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. Lecture Notes in Computer Science, vol.\u00a03958, pp. 207\u2013228. Springer (2006). https:\/\/doi.org\/10.1007\/11745853_14","DOI":"10.1007\/11745853_14"},{"key":"382_CR7","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":"382_CR8","unstructured":"Brainpool, E.C.C.: Ecc brainpool standard curves and curve generation (2005), https:\/\/web.archive.org\/web\/20070814070853\/http:\/\/www.ecc-brainpool.org\/download\/Domain-parameters.pdf"},{"key":"382_CR9","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 (Jun 2021).https:\/\/doi.org\/10.1109\/ARITH51176.2021.00026","DOI":"10.1109\/ARITH51176.2021.00026"},{"key":"382_CR10","unstructured":"Crandall, R.E.: Method and apparatus for public key exchange in a cryptographic system. US Patent 5,159,632. (1992), US Patent Application US07\/761, filed 1991-09-17"},{"key":"382_CR11","doi-asserted-by":"publisher","unstructured":"Didier, L.S., Dosso, F.Y., V\u00e9ron, P.: Efficient modular operations using the Adapted Modular Number System. Journal of Cryptographic Engineering pp. 1\u201323 (2020). https:\/\/doi.org\/10.1007\/s13389-019-00221-7, arXiv:1901.11485","DOI":"10.1007\/s13389-019-00221-7"},{"issue":"3","key":"382_CR12","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":"382_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."},{"issue":"204","key":"382_CR14","doi-asserted-by":"publisher","first-page":"927","DOI":"10.2307\/2153263","volume":"61","author":"H Dubner","year":"1993","unstructured":"Dubner, H.: Generalized repunit primes. Math. Comput. 61(204), 927\u2013930 (1993). https:\/\/doi.org\/10.2307\/2153263","journal-title":"Math. Comput."},{"issue":"2","key":"382_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BF01442667","volume":"11","author":"A Korkine","year":"1877","unstructured":"Korkine, A., Zolotareff, G.: Sur les formes quadratiques positives. Math. Ann. 11(2), 242\u2013292 (1877)","journal-title":"Math. Ann."},{"issue":"5","key":"382_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1049\/iet-ifs.2007.0132","volume":"3","author":"H Fan","year":"2009","unstructured":"Fan, H., Hasan, M.: Alternative to the karatsuba algorithm for software implementation of gf($$2^n$$) multiplication. IET Inf. Secur. 3(5), 60\u201365 (2009). https:\/\/doi.org\/10.1049\/iet-ifs.2007.0132","journal-title":"IET Inf. Secur."},{"key":"382_CR17","unstructured":"Granlund, T.: Instruction latencies and throughput for amd and intel x86 processors (2019), https:\/\/gmplib.org\/~tege\/x86-timing.pdf"},{"issue":"3","key":"382_CR18","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":"382_CR19","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."},{"key":"382_CR20","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2023033","author":"N M\u00e9loni","year":"2023","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","journal-title":"Adv. Math. Commun."},{"key":"382_CR21","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":"382_CR22","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2023033","author":"N M\u00e9loni","year":"2023","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","journal-title":"Adv. Math. Commun."},{"issue":"204","key":"382_CR23","doi-asserted-by":"publisher","first-page":"927","DOI":"10.2307\/2153263","volume":"61","author":"H Dubner","year":"1993","unstructured":"Dubner, H.: Generalized repunit primes. Math. Comput. 61(204), 927\u2013930 (1993). https:\/\/doi.org\/10.2307\/2153263","journal-title":"Math. Comput."},{"key":"382_CR24","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":"382_CR25","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the Average. In: Proceedings of the 7th Algorithmic Number Theory Symposium (2006).https:\/\/doi.org\/10.1007\/11792086_18","DOI":"10.1007\/11792086_18"},{"key":"382_CR26","doi-asserted-by":"publisher","unstructured":"Hadamard, J.: Sur la distribution des z\u00e9ros de la fonction $$\\zeta (s)$$ et ses cons\u00e9quences arithm\u00e9tiques. Bull. Soc. Math. France 24, 199\u2013220 (1896).https:\/\/doi.org\/10.24033\/bsmf.545","DOI":"10.24033\/bsmf.545"},{"key":"382_CR27","unstructured":"Plantard, T.: Polynomial modular number system on any prime fields using binomials. WRACH 2023 : Workshop on Randomness and Arithmetics for Cryptographic Hardware, https:\/\/wrach2023.sciencesconf.org\/file\/955367"},{"key":"382_CR28","doi-asserted-by":"publisher","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 (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_51","DOI":"10.1007\/3-540-54458-5_51"},{"key":"382_CR29","unstructured":"Sloane, N.J.A.: Prime $$p$$ with prime gap $$q - p$$ of $$n$$-th record cramer-shanks-granville ratio (2005), https:\/\/oeis.org\/A111943"},{"key":"382_CR30","unstructured":"Solinas, J.: Generalized mersenne numbers. Research Report CORR-99-39, Center for Applied Cryptographic Research, University of Waterloo, Waterloo, ON, Canada (1999)"},{"key":"382_CR31","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."},{"key":"382_CR32","unstructured":"de\u00a0La Vall\u00e9e\u00a0Poussin, C.J.: Recherches analytiques sur la th\u00e9orie des nombres premiers. Annales de la Soci\u00e9t\u00e9 scientifique de Bruxelles 20B, 21B, 183\u2013256, 281\u2013352, 363\u2013397, 351\u2013368 (1896)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-025-00382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-025-00382-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-025-00382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T17:41:23Z","timestamp":1759945283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-025-00382-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["382"],"URL":"https:\/\/doi.org\/10.1007\/s13389-025-00382-8","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"14 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"18"}}