{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:32Z","timestamp":1767339452816,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"TPM Metropol","award":["AAP2021-IMPECQ"],"award-info":[{"award-number":["AAP2021-IMPECQ"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2022,7,1]]},"DOI":"10.1109\/tetc.2022.3187786","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T19:27:43Z","timestamp":1657654063000},"page":"1263-1277","source":"Crossref","is-referenced-by-count":5,"title":["PMNS for Efficient Arithmetic and Small Memory Cost"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4158-9176","authenticated-orcid":false,"given":"Fangan Yssouf","family":"Dosso","sequence":"first","affiliation":[{"name":"Département SAS, École des Mines de Saint-Étienne, Saint-Étienne, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9634-5729","authenticated-orcid":false,"given":"Jean-Marc","family":"Robert","sequence":"additional","affiliation":[{"name":"Laboratoire IMath, Université de Toulon, Toulon, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-6870","authenticated-orcid":false,"given":"Pascal","family":"Veron","sequence":"additional","affiliation":[{"name":"Laboratoire IMath, Université de Toulon, Toulon, France"}]}],"member":"263","reference":[{"volume":"3","article-title":"IA-32 Intel(R) architecture software developer's manual","year":"0","key":"ref33"},{"article-title":"Sagemath","year":"0","author":"stein","key":"ref32"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.502403","article-title":"Analyzing and comparing montgomery multiplication algorithms","volume":"16","author":"koc","year":"1996","journal-title":"IEEE Micro"},{"year":"1965","author":"gauss","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2019.00048"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_11"},{"year":"0","key":"ref12"},{"year":"0","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH51176.2021.00026"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75245-3_2"},{"year":"0","key":"ref16"},{"year":"0","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70500-0_34"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02620-1_29"},{"article-title":"Gröbner bases algorithm","year":"1995","author":"ajwa","key":"ref4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54458-5_51"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref5","first-page":"335","article-title":"More generalized mersenne numbers","author":"chung","year":"2003","journal-title":"Proc Int Workshop Sel Areas Cryptogr"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442667"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5219515"},{"key":"ref7","first-page":"311","article-title":"Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor","author":"barrett","year":"1987","journal-title":"Proc Adv Cryptol"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-019-00221-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31662-3_10"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"ref21","first-page":"611","article-title":"Side channel counter-measures based on randomized AMNS modular multiplication","author":"negre","year":"2021","journal-title":"Proc 18th Int Conf Secur Cryptogr"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4344-1"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.3934\/amc.2022018","article-title":"On polynomial modular number systems over Z\/pZ","author":"bajard","year":"2022","journal-title":"Adv Math Commun"},{"year":"0","author":"proskuryakov","key":"ref26"},{"year":"0","author":"janson","key":"ref25"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/9874959\/09827923.pdf?arnumber=9827923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T19:49:15Z","timestamp":1663616955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9827923\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":33,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2022.3187786","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"type":"electronic","value":"2168-6750"},{"type":"electronic","value":"2376-4562"}],"subject":[],"published":{"date-parts":[[2022,7,1]]}}}