{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:45:45Z","timestamp":1783007145058,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425212","type":"print"},{"value":"9783540447092","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_29","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:04:18Z","timestamp":1186841058000},"page":"348-363","source":"Crossref","is-referenced-by-count":46,"title":["A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware"],"prefix":"10.1007","author":[{"given":"Gerardo","family":"Orlando","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christof","family":"Paar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"G. Agnew, R. Mullin, and S. Vanstone, \u201cAn implementation of elliptic curve cryptosystems over F2155,\u201d IEEE Journal on Selected areas in Communications, vol. 11, pp. 804\u2013813, June 1993.","DOI":"10.1109\/49.223883"},{"key":"29_CR2","volume-title":"Master\u2019s thesis, ECE Dept.","author":"M. Rosner","year":"1998","unstructured":"M. Rosner, \u201cElliptic curve cryptosystems on reconfigurable hardware,\u201d Master\u2019s thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, USA, May 1998."},{"key":"29_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-47997-X","volume-title":"Workshop on Cryptographic Hardware and Embedded Systems (CHES\u2019 99)","author":"L. Gao","year":"1999","unstructured":"L. Gao, S. Shrivastava, and G. Sobelman, \u201cElliptic curve scalar multiplier design using FPGAs,\u201d in Workshop on Cryptographic Hardware and Embedded Systems (CHES\u2019 99) (C. Koc and C. Paar, eds.), vol. LNCS 1717, Springer-Verlag, August 1999."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"S. Sutikno, R. Effendi, and A. Surya, \u201cDesign and implementation of arithmetic processor F in2155 for elliptic curve cryptosystems,\u201d in The 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pp. 647\u2013650, November 1998.","DOI":"10.1109\/APCCAS.1998.743903"},{"key":"29_CR5","volume-title":"Eight Annual IEEE Symposuium on Field-Programmable Custom Computing Machines, FCCM\u2019 00","author":"K. Leung","year":"2000","unstructured":"K. Leung, K. Ma, W. Wong, and P. Leong, \u201cFPGA implementation of a microcoded elliptic curve cryptographic processor,\u201d in Eight Annual IEEE Symposuium on Field-Programmable Custom Computing Machines, FCCM\u2019 00, (Napa Valley, California, USA), 2000."},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Workshop on Cryptographic Hardware and Embedded Systems-CHES 2000","author":"G. Orlando","year":"2000","unstructured":"G. Orlando and C. Paar, \u201cA high performance elliptic curve processor for GF(2m),\u201d in Workshop on Cryptographic Hardware and Embedded Systems-CHES 2000, vol. LNCS 1965, (Worcester, Massachusetts, USA), Springer-Verlag, August 2000."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"P. Kornerup, \u201cA systolic, linear-array multiplier for a class of right-shift algorithms,\u201d IEEE Transactions on Computers, vol. 43, pp. 892\u2013898, August 1994.","DOI":"10.1109\/12.295851"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"M. Shand and J. Vuillemin, \u201cFast implementations of RSA cryptography,\u201d in Proceedings 11th Symposium on Computer Arithmetic, pp. 252\u2013259, 1993.","DOI":"10.1109\/ARITH.1993.378085"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"H. Orup, \u201cSimplifying quotient determination in high-radix modular multiplication,\u201d in Proceedings 12th Symposium on Computer Arithmetic, pp. 193\u2013199, 1995.","DOI":"10.1109\/ARITH.1995.465359"},{"key":"29_CR10","volume-title":"Master\u2019s thesis","author":"T. Blum","year":"1999","unstructured":"T. Blum, \u201cModular exponentiation on reconfigurable hardware,\u201d Master\u2019s thesis, Dept. of ECE, Worcester Polytechnic Institute, Worcester, U.S.A., May 1999."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"S. E. Eldridge and C. D. Walter, \u201cHardware implementation of Montgomery\u2019s modular multiplication algorithm,\u201d IEEE Transactions on Computers, vol. 42, pp. 693\u2013699, July 1993.","DOI":"10.1109\/12.277287"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"W. Freking and K. Parhi, \u201cA unified method for iterative computation of modular multiplications and reduction operations,\u201d in International Conference on Computer Design (ICCD\u2019 99), pp. 80\u201387, 1999.","DOI":"10.1109\/ICCD.1999.808395"},{"key":"29_CR13","unstructured":"A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997."},{"key":"29_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I. Blake","year":"1999","unstructured":"I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography. Cambridge, UK: Cambridge University Press, first ed., 1999."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"P. Montgomery, \u201cModular multiplication without trial division,\u201d Mathematics of Computation, vol. 44, pp. 519\u2013521, April 1985.","DOI":"10.2307\/2007970"},{"key":"29_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"E. Brickell","year":"1993","unstructured":"E. Brickell, D. Gordon, K. McCurley, and D. Wilson, \u201cFast exponentiation with precomputation,\u201d in Lecture Notes in Computer Science 658: Advances in Cryptology \u2014 EUROCRYPT\u2019 92, pp. 200\u2013207, Springer-Verlag, Berlin, 1993."},{"key":"29_CR17","unstructured":"F. I. P. S. Publication, \u201cFIPS 186-2: Digital Signature Standard (DSS),\u201d January 2000."},{"key":"29_CR18","unstructured":"P1363, Standard Specifications for Public-key Cryptography (Draft Version 8). IEEE, October 1998."},{"key":"29_CR19","volume-title":"Computer Arithmetic Algorithms and Hardware Designs","author":"B. Parhami","year":"1999","unstructured":"B. Parhami, Computer Arithmetic Algorithms and Hardware Designs. New York: Oxford University Press, Inc., 1999."},{"key":"29_CR20","unstructured":"I. Koren, Computer Arithmetic Architectures. Prentice-Hall, 1993."}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2014 CHES 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44709-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:23:18Z","timestamp":1737361398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}