{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:32:37Z","timestamp":1752550357410,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/arith.2019.00048","type":"proceedings-article","created":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T19:56:55Z","timestamp":1571687815000},"page":"199-206","source":"Crossref","is-referenced-by-count":9,"title":["Randomization of Arithmetic Over Polynomial Modular Number System"],"prefix":"10.1109","author":[{"given":"Laurent-Stephane","family":"Didier","sequence":"first","affiliation":[]},{"given":"Fangan-Yssouf","family":"Dosso","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Marrez","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Veron","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39927-8_32"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17650-0_5"},{"key":"ref12","first-page":"300","article-title":"Universal exponentiation algorithm","volume":"2162","author":"clavier","year":"2001","journal-title":"CHES"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_25"},{"journal-title":"Efficient and secure modular operations using the adapted modular number system","year":"2018","author":"didier","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28368-0_18"},{"key":"ref16","article-title":"Algorithms for the closest and shortest vector problem","author":"galbraith","year":"2011","journal-title":"Mathematics of Public Key Cryptography"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5219515"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_15"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-011-0012-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21236\/ADA606588"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI-SATA.2016.7593048"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9957-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr119"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.11"},{"key":"ref29","first-page":"98","article-title":"Implementation of elliptic curve cryptography with built-in counter measures against side channel attacks","author":"trichina","year":"2002","journal-title":"CHES LNCS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45664-3_24"},{"journal-title":"Polynomial modular number systems and the roots of their reduction polynomial in the field Z\/pZ","year":"2019","author":"bajard","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/10958513_17"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24660-2_19"},{"key":"ref1","article-title":"Survey for performance and security problems of passive side-channel attacks countermeasures in ECC","author":"abarz\u00faa","year":"2019","journal-title":"Cryptology ePrint Archive"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36400-5_22"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_9"},{"key":"ref21","first-page":"94","article-title":"A family of jacobians suitable for discrete log cryptosystems","volume":"403","author":"koblitz","year":"1988","journal-title":"Crypto"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_27"},{"journal-title":"Modular arithmetic for cryptography(PhD in french)","year":"2005","author":"plantard","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70500-0_34"}],"event":{"name":"2019 IEEE 26th Symposium on Computer Arithmetic (ARITH)","start":{"date-parts":[[2019,6,10]]},"location":"Kyoto, Japan","end":{"date-parts":[[2019,6,12]]}},"container-title":["2019 IEEE 26th Symposium on Computer Arithmetic (ARITH)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8864032\/8877381\/08877389.pdf?arnumber=8877389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:54:27Z","timestamp":1658080467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8877389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/arith.2019.00048","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}