{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:40:58Z","timestamp":1729651258089,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/icassp.2017.7952342","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:35:36Z","timestamp":1497980136000},"page":"1178-1182","source":"Crossref","is-referenced-by-count":1,"title":["New residue arithmetic based Barrett algorithms: Modular polynomial computations"],"prefix":"10.1109","author":[{"given":"Hari Krishna","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanshen","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/12.709376"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44709-1_30"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2009.5117800"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45238-6_17"},{"journal-title":"Speeding up barrett and montgomery modular multiplications","year":"0","author":"knezevic","key":"ref16"},{"journal-title":"Reduction Algorithms for Polynomials","year":"0","author":"angelini","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034836"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-69499-1_7","article-title":"Modular Reduction in GF(2n) Without Pre-computation Phase","volume":"5130","author":"knezevic","year":"2008","journal-title":"Arithmetic of Finite Fields"},{"key":"ref28","article-title":"A Fast Modular Reduction Method","author":"cao","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1117\/12.557891"},{"journal-title":"Guide to Elliptic Curve Cryptography","year":"2004","author":"hankerson","key":"ref27"},{"key":"ref3","article-title":"Residue Number Systems, Theory & Implementation","author":"omondi","year":"2007","journal-title":"Advances in Comp Sc & Engg"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930104"},{"journal-title":"Computational Number Theory and Digital Signal Processing Fast Algorithms and Error Control Techniques","year":"1994","author":"krishna","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.16508"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.84"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-45539-6_37","article-title":"Cox-Rower Architecture for Fast Parallel Montgomery Multiplication","volume":"1807","author":"kawamura","year":"2000","journal-title":"Eurocrypt 2000"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0997-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/71.382314"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.11"},{"key":"ref22","first-page":"3033","article-title":"GF(2n) Montgomery Multiplication using Polynomial Residue Arithmetic","author":"schinianakis","year":"2012","journal-title":"ISCAS"},{"journal-title":"Modular Reduction without Pre-Computation for Special Moduli","year":"0","author":"acar","key":"ref21"},{"journal-title":"Residue Arithmetic and its Applications to Computer Technology","year":"1967","author":"szabo","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/3254"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1201\/9781420071474","author":"washington","year":"2008","journal-title":"Elliptic Curves Number Theory and Cryptography"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref25"}],"event":{"name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2017,3,5]]},"location":"New Orleans, LA","end":{"date-parts":[[2017,3,9]]}},"container-title":["2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7943262\/7951776\/07952342.pdf?arnumber=7952342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T07:25:10Z","timestamp":1569482710000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7952342\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icassp.2017.7952342","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}