{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:49:27Z","timestamp":1648835367750},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T00:00:00Z","timestamp":1396483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11265-014-0879-y","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T02:26:28Z","timestamp":1396405588000},"page":"249-259","source":"Crossref","is-referenced-by-count":2,"title":["A Flexible Architecture for Modular Arithmetic Hardware Accelerators based on RNS"],"prefix":"10.1007","volume":"76","author":[{"given":"Samuel","family":"Ant\u00e3o","sequence":"first","affiliation":[]},{"given":"Leonel","family":"Sousa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,3]]},"reference":[{"key":"879_CR1","doi-asserted-by":"crossref","unstructured":"Ant\u00e3o, S., Bajard, J.C., Sousa, L. (2010). Elliptic curve point multiplication on GPUs. In IEEE international conference on application-specific systems architectures and processors - ASAP (pp. 192\u2013199). Rennes: IEEE. doi: 10.1109\/ASAP.2010.5541000 .","DOI":"10.1109\/ASAP.2010.5541000"},{"issue":"5","key":"879_CR2","first-page":"629","volume":"55","author":"S Ant\u00e3o","year":"2011","unstructured":"Ant\u00e3o, S., Bajard, J.C., Sousa, L. (2011). RNS based elliptic curve point multiplication for massive parallel architectures. The Computer Journal 2011 - Oxford Journals, 55(5), 629\u2013647. doi: 10.1093\/comjnl\/BXR119 .","journal-title":"The Computer Journal 2011 - Oxford Journals"},{"key":"879_CR3","doi-asserted-by":"crossref","unstructured":"Ant\u00e3o, S., Chaves, R., Sousa, L. (2009). Compact and flexible microcoded elliptic curve processor for reconfigurable devices. In IEEE symposium on field programmable custom computing machines - FCCM (pp. 193\u2013200). Napa: IEEE. doi: 10.1109\/FCCM.2009.18 .","DOI":"10.1109\/FCCM.2009.18"},{"key":"879_CR4","unstructured":"Ant\u00e3o, S., & Sousa, L. (2012). Modular arithmetic implementation with the Residue Number System (RNS). Technical report INESC-ID, Lisbon."},{"issue":"4","key":"879_CR5","doi-asserted-by":"crossref","first-page":"33:1","DOI":"10.1145\/2400682.2400692","volume":"9","author":"S Ant\u00e3o","year":"2013","unstructured":"Ant\u00e3o, S., & Sousa, L. (2013). The CRNS framework and its application to programmable and reconfigurable cryptography. ACM Transactions on Architecture and Code Optimization, 9(4), 33:1\u201333:25. doi: 10.1145\/24006822400692 .","journal-title":"ACM Transactions on Architecture and Code Optimization"},{"key":"879_CR6","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Didier, L.S., Kornerup, P. (2001). Modular multiplication and base extensions in residue number systems. In IEEE symposium on computer arithmetic - ARITH (pp. 59\u201365). Vail: IEEE. doi: 10.1109\/ARITH.2001.930104 .","DOI":"10.1109\/ARITH.2001.930104"},{"key":"879_CR7","unstructured":"Guillermin, N. (2010). A high speed coprocessor for elliptic curve scalar multiplications over Fp. In S. Mangard, F.X. Standaert (Eds.), Lecture notes in computer science: advances in cryptology - cryptographic hardware and embedded systems - CHES 2010 (pp. 48-64). Berlin\/Heidelberg: Springer."},{"key":"879_CR8","doi-asserted-by":"crossref","unstructured":"G\u00fcneysu, T., & Paar, C. (2008). Ultra high performance ECC over NIST primes on commercial FPGAs. In E. Oswald, P. Rohatgi (Eds.), Lecture notes in computer science: advances in cryptology - cryptographic hardware and embedded systems - CHES 2008 (pp. 62\u201378). Berlin\/Heidelberg: Springer. doi: 10.1007\/978-3-540-85053-3_5 .","DOI":"10.1007\/978-3-540-85053-3_5"},{"key":"879_CR9","doi-asserted-by":"crossref","unstructured":"Kawamura, S., Koike, M., Sano, F., Shimbo, A. (2000). Cox-rower architecture for fast parallel montgomery multiplication. In B. Preneel (Ed.),Lecture notes in computer science: advances in cryptology - EUROCRYPT 2000 (pp. 523\u2013538). Berlin\/ Heidelberg: Springer. doi: 10.1007\/3-540-45539-6_37 .","DOI":"10.1007\/3-540-45539-6_37"},{"issue":"170","key":"879_CR10","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L. (1985). Modular multiplication without trial division. Mathematics of Computation, 44(170), 519\u2013521. doi: 10.1090\/S0025-5718-1985-0777282-X .","journal-title":"Mathematics of Computation"},{"key":"879_CR11","doi-asserted-by":"crossref","unstructured":"Nozaki, H., Motoyama, M., Shimbo, A., Kawamura, S. (2001). Implementation of RSA algorithm based on RNS montgomery multiplication. In \u00c7.K. Ko\u00e7, D. Naccache, C. Paar (Eds.), Lecture notes in computer science: advances in cryptology - cryptographic hardware and embedded systems - CHES 2001 (pp. 364\u2013376). Berlin\/Heidelberg: Springer. doi: 10.1007\/3-540-44709-1_30 .","DOI":"10.1007\/3-540-44709-1_30"},{"issue":"2","key":"879_CR12","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L. (1978). A method for obtaining digital signatures and public- key cryptosystems. Communications of the ACM, 21(2), 120\u2013126. doi: 10.1145\/359340.359342 .","journal-title":"Communications of the ACM"},{"issue":"6","key":"879_CR13","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1109\/TCSI.2008.2008507","volume":"56","author":"DM Schinianakis","year":"2009","unstructured":"Schinianakis, D.M., Fournaris, A.P., Michail, H.E., Kakarountas, A.P., Stouraitis, T. (2009). An RNS implementation of an F p elliptic curve point multiplier. IEEE Transactions on Circuits and Systems I: Regular Papers, 56(6), 1202\u20131213. doi: 10.1109\/TCSI.2008.2008507 .","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"issue":"2","key":"879_CR14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/12.16508","volume":"38","author":"AP Shenoy","year":"1989","unstructured":"Shenoy, A.P., & Kumaresan, R. (1989). Fast base extension using a redundant modulus in RNS. IEEE Transactions on Computers, 38(2), 292\u2013297.","journal-title":"IEEE Transactions on Computers"},{"key":"879_CR15","doi-asserted-by":"crossref","unstructured":"Suzuki, D. (2007). How to maximize the potential of FPGA resources for modular exponentiation. In P. Paillier, I. Verbauwhede (Eds.), Lecture notes in computer science: advances in cryptology - cryptographic hardware and embedded systems - CHES 2007 (pp. 272\u2013288). Berlin\/Heidelberg: Springer. doi: 10.1007\/978-3-540-74735-2_19 .","DOI":"10.1007\/978-3-540-74735-2_19"},{"key":"879_CR16","doi-asserted-by":"crossref","unstructured":"Szerwinski, R., & G\u00fcneysu, T. (2008). Exploiting the power of GPUs for asymmetric cryptography. In E. Oswald, P. Rohatgi (Eds.), Lecture notes in computer science: advances in cryptology - cryptographic hardware and embedded systems - CHES 2008 (pp. 79\u201399). Berlin\/Heidelberg: Springer. doi: 10.1007\/978-3-540-85053-3_6 .","DOI":"10.1007\/978-3-540-85053-3_6"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0879-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-014-0879-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0879-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:22:24Z","timestamp":1559391744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-014-0879-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["879"],"URL":"https:\/\/doi.org\/10.1007\/s11265-014-0879-y","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,3]]}}}