{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:22Z","timestamp":1725566242432},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226666"},{"type":"electronic","value":"9783540286325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28632-5_8","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T16:45:31Z","timestamp":1285001131000},"page":"107-118","source":"Crossref","is-referenced-by-count":12,"title":["A Low-Cost ECC Coprocessor for Smartcards"],"prefix":"10.1007","author":[{"given":"Harald","family":"Aigner","sequence":"first","affiliation":[]},{"given":"Holger","family":"Bock","sequence":"additional","affiliation":[]},{"given":"Markus","family":"H\u00fctter","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Wolkerstorfer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"8_CR2","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004) ISBN 0-387-95273-X"},{"key":"8_CR3","first-page":"455","volume-title":"Application-Specific Systems, Architectures, and Processors\u2014ASAP 2003","author":"J. Gro\u00dfsch\u00e4dl","year":"2003","unstructured":"Gro\u00dfsch\u00e4dl, J., Kamendje, G.: Instruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2\n                    m\n                  ). In: Application-Specific Systems, Architectures, and Processors\u2014ASAP 2003, pp. 455\u2013468. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Goodman, J., Chandrakasan, A.P.: An Energy-efficient Reconfigurable Public-Key Cryptography Processor. IEEE Journal of Solid-State Circuits, 1808\u20131820 (November 2001)","DOI":"10.1109\/4.962304"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-36400-5_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"R. Schroeppel","year":"2003","unstructured":"Schroeppel, R., Beaver, C., Gonzales, R., Miller, R., Draelos, T.: A Low-Power Design for an Elliptic Curve Digital Signature Chip. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 366\u2013380. Springer, Heidelberg (2003)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-44499-8_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"S. Okada","year":"2000","unstructured":"Okada, S., Torii, N., Itoh, K., Takenaka, M.: Implementation of elliptic curve cryptographic coprocessor over GF(2) on an FPGA. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 25\u201340. Springer, Heidelberg (2000)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44499-8_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"G. Orlando","year":"2000","unstructured":"Orlando, G., Paar, C.: A High-performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 41\u201356. Springer, Heidelberg (2000)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-36400-5_26","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"N. Gura","year":"2003","unstructured":"Gura, N., Chang Shantz, S., Eberle, H., Finchelstein, D., Gupta, S., Gupta, V., Stebila, D.: An End-to-End Systems Approach to Elliptic Curve Cryptography. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 349\u2013365. Springer, Heidelberg (2003)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-36400-5_28","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Ernst","year":"2003","unstructured":"Ernst, M., Jung, M., Madlener, F., Huss, S., Bl\u00fcmel, R.: A reconfigurable system on chip implementation for elliptic curve cryptography over GF(2m). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 381\u2013399. Springer, Heidelberg (2003)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-44499-8_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"E. Sava\u015f","year":"2000","unstructured":"Sava\u015f, E., Tenca, A., Ko\u00e7, \u00c7.: A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m). In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 277\u2013292. Springer, Heidelberg (2000)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","first-page":"206","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"J. Gro\u00dfsch\u00e4dl","year":"2001","unstructured":"Gro\u00dfsch\u00e4dl, J.: A Bitserial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m). In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 206\u2013223. Springer, Heidelberg (2001)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-36400-5_36","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"J. Wolkerstorfer","year":"2003","unstructured":"Wolkerstorfer, J.: Dual-Field Arithmetic Unit for GF(p) and GF(2m). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 500\u2013514. Springer, Heidelberg (2003)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-36400-5_35","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"A. Gutub","year":"2003","unstructured":"Gutub, A., Tenca, A., Sava\u015f, E., Ko\u00e7, \u00c7.: Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2m). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 484\u2013499. Springer, Heidelberg (2003)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J. L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 316\u2013327. Springer, Heidelberg (1999)"},{"key":"8_CR15","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":"8_CR16","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation\u00a048 (1987)","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"\u00c9. Brier","year":"2002","unstructured":"Brier, \u00c9., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, p. 335. Springer, Heidelberg (2002)"},{"key":"8_CR18","unstructured":"IEEE P1363, Standard Specifications for Public-Key Cryptography, IEEE standard (2000)"},{"key":"8_CR19","unstructured":"Infineon Technologies, Security and Chip Card ICs, SLE 66CX322P, Product Information (2002)"},{"key":"8_CR20","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory, revised 1984 edition. Aegean Park Press (1984)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Johnson, D.B., Menezes, A.J., Vanstone, S.: The Elliptic Curve Digital Signature Algorithm (ECDSA). International Journal of Information Security\u00a01 (2001)","DOI":"10.1007\/s102070100002"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28632-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:28:43Z","timestamp":1619998123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28632-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226666","9783540286325"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28632-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}