{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:17:08Z","timestamp":1725556628258},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_16","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T22:20:16Z","timestamp":1274826016000},"page":"156-165","source":"Crossref","is-referenced-by-count":0,"title":["A Massively Parallel Hardware for Modular Exponentiations Using the m-ary Method"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Santana Farias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9rgio","family":"de Souza Raposo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Nedjah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.15388\/Informatica.2006.148","volume":"17","author":"C.L. Wu","year":"2006","unstructured":"Wu, C.L., Lou, D.C., Lai, J.C., Chang, T.J.: Fast parallel exponentiation algorithm for RSA Public-Key Cryptosystem. Informatica\u00a017, 445\u2013462 (2006)","journal-title":"Informatica"},{"key":"16_CR2","volume-title":"The art of computer programming: seminumerical algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The art of computer programming: seminumerical algorithms, 2nd edn. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"16_CR3","first-page":"516","volume-title":"Proc. Symposium on Digital System Design: Architectures, Methods and Tools","author":"L.M. Mourelle","year":"2004","unstructured":"Mourelle, L.M., Nedjah, N.: Fast reconfigurale hardware for the m-ary modular exponentiation. In: Proc. Symposium on Digital System Design: Architectures, Methods and Tools, pp. 516\u2013523. IEEE Computer Society, Los Alamitos (2004)"},{"key":"16_CR4","volume-title":"VHDL \u2013 Analysis and modeling of digital systems","author":"Z. Navabi","year":"1998","unstructured":"Navabi, Z.: VHDL \u2013 Analysis and modeling of digital systems, 2nd edn. McGraw Hill, New York (1998)","edition":"2"},{"key":"16_CR5","first-page":"3","volume-title":"Proc. of the 15th. SBCCI","author":"N. Nedjah","year":"2002","unstructured":"Nedjah, N., Mourelle, L.M.: Two hardware implementations for the Montgomery multiplication: sequential vs. parallel. In: Proc. of the 15th. SBCCI, pp. 3\u20138. IEEE Computer Society, Los Alamitos (2002)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-36077-8_43","volume-title":"Advances in Information Systems","author":"N. Nedjah","year":"2002","unstructured":"Nedjah, N., Mourelle, L.M.: Efficient Parallel Modular Exponentiation Algorithm. In: Yakhno, T. (ed.) ADVIS 2002. LNCS, vol.\u00a02457, pp. 405\u2013414. Springer, Heidelberg (2002)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Nedjah, N., Mourelle, L.M.: Efficient hardware for modular exponentiation using the sliding-window method with variable-length partitioning. In: Proc. ICYCS, pp. 1980\u20131985 (2008)","DOI":"10.1109\/ICYCS.2008.421"},{"issue":"6","key":"16_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10766-009-0108-7","volume":"37","author":"N. Nedjah","year":"2009","unstructured":"Nedjah, N., Mourelle, L.M.: High-performance hardware of the sliding-window method for parallel computation of modular exponentiations. International Journal of Parallel Programming\u00a037(6), 537\u2013555 (2009)","journal-title":"International Journal of Parallel Programming"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signature and public-key cryptosystems. Communication of ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communication of ACM"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044, 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"16_CR11","unstructured":"Xilinx, Inc. Foundation Series Software (2009), http:\/\/www.xilinx.com"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T01:25:05Z","timestamp":1591320305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}