{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:40:09Z","timestamp":1746232809005,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662434130"},{"type":"electronic","value":"9783662434147"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43414-7_21","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T14:57:06Z","timestamp":1400597826000},"page":"421-437","source":"Crossref","is-referenced-by-count":12,"title":["A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over $$\\mathrm{GF}(p)$$"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Ma","sequence":"first","affiliation":[]},{"given":"Zongbin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wuqiong","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Jiwu","family":"Jing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"issue":"7","key":"21_CR1","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/12.936241","volume":"50","author":"T Blum","year":"2001","unstructured":"Blum, T., Paar, C.: High-radix montgomery modular exponentiation on reconfigurable hardware. IEEE Trans. Comput. 50(7), 759\u2013764 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"5\u20136","key":"21_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.micpro.2004.03.006","volume":"28","author":"A Daly","year":"2004","unstructured":"Daly, A., Marnane, W.P., Kerins, T., Popovici, E.M.: An FPGA implementation of a $${\\rm {GF}}(p)$$ ALU for encryption processors. Microprocess. Microsyst. 28(5\u20136), 253\u2013260 (2004)","journal-title":"Microprocess. Microsyst."},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/12.277287","volume":"42","author":"SE Eldridge","year":"1993","unstructured":"Eldridge, S.E., Walter, C.D.: Hardware implementation of montgomery\u2019s modular multiplication algorithm. IEEE Trans. Comput. 42(6), 693\u2013699 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR4","series-title":"LNCS","first-page":"48","volume-title":"CHES 2010","author":"N Guillermin","year":"2010","unstructured":"Guillermin, N.: A high speed coprocessor for elliptic curve scalar multiplications over $${\\mathbb{F}}_p$$ . In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 48\u201364. Springer, Heidelberg (2010)"},{"key":"21_CR5","series-title":"LNCS","first-page":"62","volume-title":"CHES 2008","author":"T G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, Ch.: Ultra high performance ECC over NIST primes on commercial FPGAs. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 62\u201378. Springer, Heidelberg (2008)"},{"key":"21_CR6","volume-title":"Guide to elliptic curve cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Vanstone, S., Menezes, A.J.: Guide to elliptic curve cryptography. Springer, New York (2004)"},{"key":"21_CR7","series-title":"LNCS","first-page":"214","volume-title":"PKC 2008","author":"M Huang","year":"2008","unstructured":"Huang, M., Gaj, K., Kwon, S., El-Ghazawi, T.: An optimized hardware architecture for the montgomery multiplication algorithm. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 214\u2013228. Springer, Heidelberg (2008)"},{"issue":"177","key":"21_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: High-radix systolic modular multiplication on reconfigurable hardware. In: Brebner, G.J., Chakraborty, S., Wong, W.F. (eds) FPT 2005, pp. 13\u201318. IEEE (2005)","DOI":"10.1109\/FPT.2005.1568518"},{"issue":"9","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1946","DOI":"10.1109\/TCSI.2006.880184","volume":"53","author":"CJ McIvor","year":"2006","unstructured":"McIvor, C.J., McLoone, M., McCanny, J.V.: Hardware elliptic curve cryptographic processor over $${\\rm {GF}}(p)$$ . IEEE Trans. Circ. Syst. I: Regul. Pap. 53(9), 1946\u20131957 (2006)","journal-title":"IEEE Trans. Circ. Syst. I: Regul. Pap."},{"key":"21_CR11","unstructured":"Mentens, N.: Secure and efficient coprocessor design for cryptographic applications on FPGAs. Ph.D. thesis, Katholieke Universiteit Leuven (2007)"},{"key":"21_CR12","series-title":"LNCS","first-page":"417","volume-title":"CRYPTO 1985","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"21_CR13","series-title":"LNCS","first-page":"324","volume-title":"ISC 2001","author":"B M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 324\u2013334. Springer, Heidelberg (2001)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks, addendum: Efficiency improvement. http:\/\/pdf.aminer.org\/000\/452\/864\/securing_elliptic_curve_point_multiplication_against_side_channel_attacks.pdf (2001)","DOI":"10.1007\/3-540-45439-X_22"},{"key":"21_CR15","series-title":"LNCS","first-page":"402","volume-title":"ISC 2002","author":"B M\u00f6ller","year":"2002","unstructured":"M\u00f6ller, B.: Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 402\u2013413. Springer, Heidelberg (2002)"},{"issue":"170","key":"21_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"21_CR17","series-title":"LNCS","first-page":"348","volume-title":"CHES 2001","author":"G Orlando","year":"2001","unstructured":"Orlando, G., Paar, C.: A scalable GF( $$p$$ ) elliptic curve processor architecture for programmable hardware. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 348\u2013363. Springer, Heidelberg (2001)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Orup, H.: Simplifying quotient determination in high-radix modular multiplication. In: IEEE Symposium on Computer Arithmetic, pp. 193\u2013199 (1995)","DOI":"10.1109\/ARITH.1995.465359"},{"key":"21_CR19","series-title":"LNCS","first-page":"272","volume-title":"CHES 2007","author":"D Suzuki","year":"2007","unstructured":"Suzuki, D.: How to maximize the potential of FPGA resources for modular exponentiation. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 272\u2013288. Springer, Heidelberg (2007)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Tang, S.H., Tsui, K.S., Leong, P.H.W.: Modular exponentiation using parallel multipliers. In: FPT 2003, pp. 52\u201359. IEEE (2003)","DOI":"10.1109\/FPT.2003.1275731"},{"key":"21_CR21","series-title":"LNCS","first-page":"94","volume-title":"CHES 1999","author":"AF Tenca","year":"1999","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A scalable architecture for montgomery multiplication. In: Ko\u00e7, \u00c7.K., Paar, Ch. (eds.) CHES 1999. LNCS, vol. 1717, pp. 94\u2013108. Springer, Heidelberg (1999)"},{"key":"21_CR22","series-title":"LNCS","first-page":"185","volume-title":"CHES 2001","author":"AF Tenca","year":"2001","unstructured":"Tenca, A.F., Todorov, G., Ko\u00e7, \u00c7.K.: High-radix design of a scalable modular multiplier. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, Ch. (eds.) CHES 2001. LNCS, vol. 2162, pp. 185\u2013201. Springer, Heidelberg (2001)"},{"issue":"3","key":"21_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/12.210181","volume":"42","author":"CD Walter","year":"1993","unstructured":"Walter, C.D.: Systolic modular multiplication. IEEE Trans. Comput. 42(3), 376\u2013378 (1993)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography -- SAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43414-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:59:03Z","timestamp":1746230343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}