{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:29:07Z","timestamp":1743085747379,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662474006"},{"type":"electronic","value":"9783662474013"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47401-3_15","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:04Z","timestamp":1434702424000},"page":"114-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RSA Encryption\/Decryption Implementation Based on Zedboard"],"prefix":"10.1007","author":[{"given":"Xu","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianlong","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"15_CR1","unstructured":"Su, F., Hwang, T.: Comments on iterative modular multiplication without magnitude comparison. In: Proceedings of the 6th National Conference on Information Security, pp. 21\u201322 (1996)"},{"issue":"9","key":"15_CR2","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1016\/S0140-3664(99)00043-2","volume":"22","author":"CY Chen","year":"1999","unstructured":"Chen, C.Y., Liu, T.C.: A fast modular multiplication method based on the lempel\u2013ziv binary tree. Comput. Commun. 22(9), 871\u2013874 (1999)","journal-title":"Comput. Commun."},{"issue":"4","key":"15_CR3","first-page":"100","volume":"1","author":"G Kaur","year":"2013","unstructured":"Kaur, G., Arora, V.: An efficient implementation of RSA algorithm using FPGA and big prime digit. IJCCER 1(4), 100\u2013103 (2013)","journal-title":"IJCCER"},{"issue":"9","key":"15_CR4","first-page":"10","volume":"19","author":"SK Sahu","year":"2011","unstructured":"Sahu, S.K., Pradhan, M.: FPGA implementation of RSA encryption system. Int. J. Comput. Appl. 19(9), 10\u201312 (2011)","journal-title":"Int. J. Comput. Appl."},{"key":"15_CR5","unstructured":"Anand, A., Praveen, P.: Implementation of RSA algorithm on FPGA. Int. J. Eng. Res. Technol. 1(5) (2012)"},{"issue":"1","key":"15_CR6","first-page":"79","volume":"2","author":"Y Ito","year":"2012","unstructured":"Ito, Y., Nakano, K., Bo, S.: The parallel FDFM processor core approach for CRT-based RSA decryption. Int. J. Netw. Comput. 2(1), 79\u201396 (2012)","journal-title":"Int. J. Netw. Comput."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Christofi, M., Chetali, B., Goubin, L.: Formal verification of an implementation of CRT-RSA vigilants algorithm. In: PROOFS Workshop: Pre-proceedings, p. 28 (2013)","DOI":"10.1007\/s13389-013-0049-3"},{"key":"15_CR8","unstructured":"Attili, S., Jain, S., Mitra, S.: PS and PL ethernet performance and jumbo frame support with PL ethernet in the Zynq-7000 AP SoC (2013)"},{"issue":"1","key":"15_CR9","first-page":"23","volume":"15","author":"GRC Rao","year":"2013","unstructured":"Rao, G.R.C., Lakshmi, P., Shankar, N.R.: A new modular multiplication method in public key cryptosystem. IJ Netw. Secur. 15(1), 23\u201327 (2013)","journal-title":"IJ Netw. Secur."},{"issue":"7","key":"15_CR10","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1109\/TIE.2010.2080653","volume":"58","author":"GD Sutter","year":"2011","unstructured":"Sutter, G.D., Deschamps, J., Ima\u00f1a, J.L.: Modular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation. IEEE Trans. Ind. Electron. 58(7), 3101\u20133109 (2011)","journal-title":"IEEE Trans. Ind. Electron."},{"key":"15_CR11","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"2010","unstructured":"Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2010)"},{"issue":"21","key":"15_CR12","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18(21), 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-24707-4_19","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"C Kim","year":"2004","unstructured":"Kim, C., Ha, J.C., Kim, S.-H., Kim, S., Yen, S.-M., Moon, S.-J.: A secure and practical CRT-based RSA to resist side channel attacks. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3043, pp. 150\u2013158. Springer, Heidelberg (2004)"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1109\/TCSI.2005.858767","volume":"53","author":"N Nedjah","year":"2006","unstructured":"Nedjah, N., Mourelle, L.M.: Three hardware architectures for the binary modular exponentiation: sequential, parallel, and systolic. IEEE Trans. Circuits Syst. I: Regul. Pap. 53(3), 627\u2013633 (2006)","journal-title":"IEEE Trans. Circuits Syst. I: Regul. Pap."},{"issue":"7","key":"15_CR16","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1109\/12.256444","volume":"41","author":"N Takagi","year":"1992","unstructured":"Takagi, N., Yajima, S.: Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem. IEEE Trans. Comput. 41(7), 887\u2013891 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR17","volume-title":"Embedded System Hardware and Software Co-design Practical Guide based on XilinxZynq","author":"J Lu","year":"2013","unstructured":"Lu, J., Jiang, Z., Ma, M.: Embedded System Hardware and Software Co-design Practical Guide based on XilinxZynq. China Machine Press, Beijing (2013)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Wu, C.H., Hong, J.H., Wu, C.W.: RSA cryptosystem design based on the chinese remainder theorem. In: Proceedings of the 2001 Asia and South Pacific Design Automation Conference, pp. 391\u2013395. ACM (2001)","DOI":"10.1145\/370155.370419"}],"container-title":["Communications in Computer and Information Science","Trustworthy Computing and Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47401-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:41:02Z","timestamp":1675273262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47401-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662474006","9783662474013"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47401-3_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}