{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T04:00:39Z","timestamp":1780200039499,"version":"3.54.0"},"publisher-location":"Cham","reference-count":17,"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_18","type":"book-chapter","created":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:03:49Z","timestamp":1780196629000},"page":"284-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Feasibility of\u00a0256-Bit Prime Field Arithmetic via\u00a0PMNS on\u00a08-Bit Architectures"],"prefix":"10.1007","author":[{"given":"Daichi","family":"Aoki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38(4), 393\u2013422 (2002)","journal-title":"Comput. Netw."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Imbert, L., Plantard, T.: Modular number systems: beyond the Mersenne family. In: Handschuh, H., Hasan, A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 159\u2013169. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30564-4_11"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Imbert, L., Plantard, T.: Arithmetic operations in the polynomial modular number system. In: 17th IEEE Symposium on Computer Arithmetic, Cape Cod, MA, USA, pp. 206\u2013213. IEEE Computer Society (2005)","DOI":"10.1109\/ARITH.2005.11"},{"issue":"3","key":"18_CR4","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 Z\/pZ. Adv. Math. Commun. 18(3), 674\u2013695 (2024)","journal-title":"Adv. Math. Commun."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Coladon, T., Elbaz-Vincent, P., Hugounenq, C.: MPHELL: a fast and robust library with unified and versatile arithmetics for elliptic curves cryptography. In: IEEE 28th Symposium on Computer Arithmetic, Lyngby, Denmark, pp. 78\u201385. IEEE (2021)","DOI":"10.1109\/ARITH51176.2021.00026"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Duquesne, S., El Mrabet, N., Gautier, E.: PMNS arithmetic for elliptic curve cryptography. In: Nitaj, A., Petkova-Nikova, S., Rijmen, V. (eds.) AFRICACRYPT 2025. LNCS, vol. 15651, pp. 164\u2013191. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-97260-7_9"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s13389-025-00382-8","volume":"15","author":"FY Dosso","year":"2025","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. J. Cryptogr. Eng. 15(3), 18 (2025)","journal-title":"J. Cryptogr. Eng."},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TEC.1959.5219515","volume":"8","author":"HL Garner","year":"1959","unstructured":"Garner, H.L.: The residue number system. IRE Trans. Electron. Comput. 8(2), 140\u2013147 (1959)","journal-title":"IRE Trans. Electron. Comput."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In: Joye, M., Quisquater, J.J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119\u2013132. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28632-5_9"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s13389-015-0093-2","volume":"5","author":"M Hutter","year":"2015","unstructured":"Hutter, M., Schwabe, P.: Multiprecision multiplication on AVR revisited. J. Cryptogr. Eng. 5(3), 201\u2013214 (2015)","journal-title":"J. Cryptogr. Eng."},{"issue":"4","key":"18_CR11","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."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Liu, A., Ning, P.: TinyECC: a configurable library for elliptic curve cryptography in wireless sensor networks. In: Proceedings of the 7th International Conference on Information Processing in Sensor Networks, IPSN 2008, St. Louis, Missouri, USA, pp. 245\u2013256. IEEE Computer Society (2008)","DOI":"10.1109\/IPSN.2008.47"},{"key":"18_CR13","doi-asserted-by":"crossref","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 (1985)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"18_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-70500-0_34"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Oliveira, L.B., Aranha, D.F., Morais, E., Daguano, F., L\u00f3pez, J., Dahab, R.: TinyTate: computing the Tate pairing in resource-constrained sensor nodes. In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), Cambridge, MA, USA, pp. 318\u2013323. IEEE Computer Society (2007)","DOI":"10.1109\/NCA.2007.48"},{"issue":"24","key":"18_CR16","doi-asserted-by":"publisher","first-page":"8816","DOI":"10.3390\/app10248816","volume":"10","author":"D Park","year":"2020","unstructured":"Park, D., Chang, N.S., Lee, S., Hong, S.: Fast implementation of NIST P-256 elliptic curve cryptography on 8-bit AVR processor. Appl. Sci. 10(24), 8816 (2020)","journal-title":"Appl. Sci."},{"issue":"2","key":"18_CR17","first-page":"120","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. Assoc. Comput. Mach. 21(2), 120\u2013126 (1978)","journal-title":"Commun. Assoc. Comput. Mach."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:03:52Z","timestamp":1780196632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27574-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032275738","9783032275745"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27574-5_18","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"}}]}}