{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T10:42:43Z","timestamp":1780915363499,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642150302","type":"print"},{"value":"9783642150319","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15031-9_4","type":"book-chapter","created":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T15:34:35Z","timestamp":1281195275000},"page":"48-64","source":"Crossref","is-referenced-by-count":58,"title":["A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\\mathbb{F}_p$"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Guillermin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"7","key":"4_CR1","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.709376","volume":"47","author":"J.-C. Bajard","year":"1998","unstructured":"Bajard, J.-C., Didier, L.-S., Kornerup, P.: An rns montgomery modular multiplication algorithm. IEEE Transactions on Computers\u00a047(7), 766\u2013776 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","first-page":"116","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"J.-C. Bajard","year":"2004","unstructured":"Bajard, J.-C., Imbert, L., Liardet, P.-Y., Teglia, Y.: Leak resistant arithmetic. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 116\u2013145. Springer, Heidelberg (2004)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BF02687893","volume":"21","author":"L. Chen","year":"2004","unstructured":"Chen, L., Yanpu, C., Zhengzhong, B.: An implementation of fast algorithm for elliptic curve cryptosystem over GF(p). Journal of Electronics (China)\u00a021(4), 346\u2013352 (2004)","journal-title":"Journal of Electronics (China)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J.-S. Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Edwards, H.: A normal form for elliptic curves. Bull. Amer. Math. Soc.\u00a044 (2007)","DOI":"10.1090\/S0273-0979-07-01153-6"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-45238-6_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"P.-A. Fouque","year":"2003","unstructured":"Fouque, P.-A., Valette, F.: The doubling attack \u2013 why upwards is better than downwards. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 269\u2013280. Springer, Heidelberg (2003)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-85053-3_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"T. G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, C.: Ultra high performance ecc over nist primes on commercial fpgas. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 62\u201378. Springer, Heidelberg (2008)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Jarvinen, K.U., Skytta, J.O.: High-speed elliptic curve cryptography accelerator for koblitz curves. In: Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 109\u2013118 (2008)","DOI":"10.1109\/FCCM.2008.30"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Sung-Min-Yen: The montgomery powering ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-45539-6_37","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Kawamura","year":"2000","unstructured":"Kawamura, S., Koike, M., Sano, F., Shimbo, A.: Cox-rower architecture for fast parallel montgomery multiplication. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 523\u2013538. Springer, Heidelberg (2000)"},{"key":"4_CR11","unstructured":"Mentens, N.: Secure and Efficient Coprocessor Design for Cryptographic Applications on FPGAs. PhD thesis, Ruhr-University Bochum (2007)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48059-5_14","volume-title":"Cryptographic Hardware and Embedded Systems","author":"T.S. Messerges","year":"1999","unstructured":"Messerges, T.S., Dabbish, E.A., Sloan, R.H.: Power analysis attacks of modular exponentiation in smartcards. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 144\u2013157. Springer, Heidelberg (1999)"},{"issue":"2-3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.sysarc.2006.09.002","volume":"53","author":"G.M. Dormale de","year":"2007","unstructured":"de Dormale, G.M., Quisquater, J.-J.: High-speed hardware implementations of elliptic curve cryptography: A survey. J. Syst. Archit.\u00a053(2-3), 72\u201384 (2007)","journal-title":"J. Syst. Archit."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","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":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-44709-1_30","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"H. Nozaki","year":"2001","unstructured":"Nozaki, H., Motoyama, M., Shimbo, A., Kawamura, S.-i.: Implementation of rsa algorithm based on rns montgomery multiplication. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 364\u2013376. Springer, Heidelberg (2001)"},{"key":"4_CR17","unstructured":"National Institute of Science and Technology. The digital signature standard. Technical report, \n                    \n                      http:\/\/csrc.nist.gov\/publications\/fips\/archive\/fips186-2\/fips186-2.pdf"},{"key":"4_CR18","unstructured":"White Paper. Stratix vs. virtex-ii pro fpga performance analysis. Technical report, \n                    \n                      http:\/\/www.altera.com\/literature\/wp\/wpstxvrtxII.pdf"},{"issue":"5","key":"4_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"K.C. Posch","year":"1995","unstructured":"Posch, K.C., Posch, R.: Modulo reduction in residue number systems. IEEE Trans. Parallel Distrib. Syst.\u00a06(5), 449\u2013454 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4_CR20","unstructured":"Ecegovac, M., Duquesne, S., Bajard, J.C.: Combining leak-resistant arithmetic for elliptic curves define over \n                    \n                      \n                    \n                    $\\mathbb{F}_p$\n                   and rns representation"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11802839_43","volume-title":"Reconfigurable Computing: Architectures and Applications","author":"K. Sakiyama","year":"2006","unstructured":"Sakiyama, K., Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Reconfigurable modular arithmetic logic unit for high-performance public-key cryptosystems. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds.) ARC 2006. LNCS, vol.\u00a03985, pp. 347\u2013357. Springer, Heidelberg (2006)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TC.2003.1190586","volume":"52","author":"A. Satoh","year":"2003","unstructured":"Satoh, A., Takano, K.: A scalable dual-field elliptic curve cryptographic processor. IEEE Transactions on Computers\u00a052, 449\u2013460 (2003)","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1109\/TCSI.2008.2008507","volume":"56","author":"D.M. Schinianakis","year":"2009","unstructured":"Schinianakis, D.M., Fournaris, A.P., Michail, H.E., Kakarountas, A.P., Stouraitis, T.: An rns implementation of an fpelliptic curve point multiplier. Trans. Cir. Sys. Part I\u00a056(6), 1202\u20131213 (2009)","journal-title":"Trans. Cir. Sys. Part I"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/12.16508","volume":"38","author":"P.P. Shenoy","year":"1989","unstructured":"Shenoy, P.P., Kumaresan, R.: Fast base extension using a redundant modulus in rns. IEEE Trans. Comput.\u00a038(2), 292\u2013297 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85053-3_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"R. Szerwinski","year":"2008","unstructured":"Szerwinski, R., Gayneysu, T.: Exploiting the power of GPUs for asymmetric cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 79\u201399. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems, CHES 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15031-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:45:18Z","timestamp":1619786718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15031-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150302","9783642150319"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15031-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}