{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:17:00Z","timestamp":1742379420774},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425212"},{"type":"electronic","value":"9783540447092"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_18","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:04:18Z","timestamp":1186826658000},"page":"202-219","source":"Crossref","is-referenced-by-count":15,"title":["A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)"],"prefix":"10.1007","author":[{"given":"Johann","family":"Gro\u00dfsch\u00e4dl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","first-page":"311","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"P. Barrett","year":"1987","unstructured":"P. Barrett. Implementing the Rivest, Shamir and Adleman public-key encryption algorithm on a standard digital signal processor. In A. M. Odlyzko (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 86, vol. 263 of Lecture Notes in Computer Science, pp. 311\u2013323. Springer-Verlag, Berlin, Germany, 1987."},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","first-page":"302","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"T. Beth","year":"1987","unstructured":"T. Beth, B. M. Cook, and D. Gollmann. Architectures for exponentiation in GF(2n). In A. M. Odlyzko, (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 86, vol. 263 of Lecture Notes in Computer Science, pp. 302\u2013310. Springer-Verlag, Berlin, Germany, 1987."},{"key":"18_CR3","series-title":"London Mathematial Society Lecture Notes Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I. F. Blake","year":"1999","unstructured":"I. F. Blake, G. Seroussi, and N. P. Smart. Elliptic Curves in Cryptography, vol. 265 of London Mathematial Society Lecture Notes Series. Cambridge University Press, Cambridge, UK, 1999."},{"issue":"5","key":"18_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TC.1983.1676262","volume":"32","author":"G. R. Blakley","year":"1983","unstructured":"G. R. Blakley. A computer algorithm for calculating the product AB modulo M. IEEE Transactions on Computers, 32(5):497\u2013500, May 1983.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR5","first-page":"51","volume-title":"Advances in Cryptology: Proceedings of CRYPTO\u2019 82","author":"E. F. Brickell","year":"1982","unstructured":"E. F. Brickell. A fast modular multiplication algorithm with application to two key cryptography. In D. Chaum, R. L. Rivest, and A. T. Sherman (eds.), Advances in Cryptology: Proceedings of CRYPTO\u2019 82, pp. 51\u201360. Plenum Press, New York, NY, USA, 1982."},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","first-page":"174","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","author":"J. Goodman","year":"2000","unstructured":"J. Goodman and A. Chandrakasan. An energy efficient reconfigurable publik-key cryptography processor architecture. In \u00c7. K. Ko\u00e7 and C. Paar (eds.), Cryptographic Hardware and Embedded Systems \u2014 CHES 2000, vol. 1965 of Lecture Notes in Computer Science, pp. 174\u2013191. Springer-Verlag, Berlin, Germany, 2000."},{"key":"18_CR7","first-page":"37","volume":"IV","author":"J. Gro\u03c3ch\u00e4dl","year":"2001","unstructured":"J. Gro\u03c3ch\u00e4dl. A low-power bit-serial multiplier for finite fields GF(2m). In Proceedings of the 34th IEEE International Symposium on Circuits and Systems (ISCAS 2001), vol. IV, pp. 37\u201340, 2001.","journal-title":"Proceedings of the 34th IEEE International Symposium on Circuits and Systems (ISCAS 2001)"},{"issue":"2","key":"18_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/92.585224","volume":"5","author":"Y.-J. Jeong","year":"1997","unstructured":"Y.-J. Jeong and W. P. Burleson. VLSI array algorithms and architectures for RSA modular multiplication. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 5(2):211\u2013217, June 1997.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"177","key":"18_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, vol. 48, no. 177, pp. 203\u2013209, January 1987.","journal-title":"Mathematics of Computation"},{"issue":"2\/3","key":"18_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1008354106356","volume":"19","author":"N. Koblitz","year":"2000","unstructured":"N. Koblitz, A. J. Menezes, and S. A. Vanstone. The state of elliptic curve cryptography. Designs, Codes and Cryptography, 19(2\/3):173\u2013193, March 2000.","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7. K. Ko\u00e7","year":"1998","unstructured":"\u00c7. K. Ko\u00e7 and T. Acar. Montgomery multiplication in GF(2k). Designs, Codes and Cryptography, 14(1):57\u201369, April 1998.","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/ARITH.1993.378082","volume-title":"Proceedings of the 11th IEEE Symposium on Computer Arithmetic","author":"P. Kornerup","year":"1993","unstructured":"P. Kornerup. High-radix modular multiplication for cryptosystems. In G. Jullien, M. J. Irwin, and E. E. Swartzlander (eds.), Proceedings of the 11th IEEE Symposium on Computer Arithmetic, pp. 277\u2013283. IEEE Computer Society Press, Los Alamitos, CA, USA, 1993."},{"key":"18_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-46588-1_30","volume-title":"Public Key Cryptography \u2014 PKC 2000","author":"A. K. Lenstra","year":"2000","unstructured":"A. K. Lenstra and E. R. Verheul. Selecting cryptographic key sizes. In H. Imai and Y. Zheng (eds.), Public Key Cryptography \u2014 PKC 2000, vol. 1751 of Lecture Notes in Computer Science, pp. 446\u2013465. Springer-Verlag, Berlin, Germany, 2000."},{"key":"18_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R. Lidl","year":"1994","unstructured":"R. Lidl and H. Niederreiter. Introduction to Finite Fields and Their Applications. Second edition. Cambridge University Press, Cambridge, UK, 1994.","edition":"Second edition"},{"key":"18_CR15","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key Cryptosystems","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes. Elliptic Curve Public Key Cryptosystems, vol. 234 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, MA, USA, 1993."},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 85","author":"V. S. Miller","year":"1986","unstructured":"V. S. Miller. Use of elliptic curves in cryptography. In H. C. Williams (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 85, vol. 218 of Lecture Notes in Computer Science, pp. 417\u2013426. Springer-Verlag, Berlin, Germany, 1986."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519\u2013521, April 1985.","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"18_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/0-387-34805-0_36","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"H. Morita","year":"1990","unstructured":"H. Morita. A fast modular-multiplication algorithm based on a higher radix. In G. Brassard (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 89, vol. 435 of Lecture Notes in Computer Science, pp. 387\u2013399. Springer-Verlag, Berlin, Germany, 1990."},{"key":"18_CR19","unstructured":"National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards (FIPS) Publication 186-2. Online available at \n                    http:\/\/csrc.nist.gov\/encryption\n                    \n                  . February 2000."},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-46877-3_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 90","author":"H. Orup","year":"1991","unstructured":"H. Orup, E. Svendsen, and E. Andreasen. VICTOR an efficient RSA hardware implementation. In I. Damg\u00e5rd, (ed.), Advances in Cryptology \u2014 EUROCRYPT\u2019 90, vol. 473 of Lecture Notes in Computer Science, pp. 245\u2013252. Springer-Verlag, Berlin, Germany, 1991."},{"key":"18_CR21","volume-title":"Computer Arithmetic: Algorithms and Hardware Designs","author":"B. Parhami","year":"2000","unstructured":"B. Parhami. Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, New York, NY, USA, 2000."},{"key":"18_CR22","volume-title":"Error-Correcting Codes","author":"W. W. Peterson","year":"1972","unstructured":"W. W. Peterson and E. J. Weldon. Error-Correcting Codes. Second edition. MIT Press, Cambridge, MA, USA, 1972.","edition":"Second edition"},{"key":"18_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-44499-8_22","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","author":"E. Sava\u015f","year":"2000","unstructured":"E. Sava\u015f, A. F. Tenca, and \u00c7. K. Ko\u00e7. A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m). In \u00c7. K. Ko\u00e7 and C. Paar (eds.), Cryptographic Hardware and Embedded Systems \u2014 CHES 2000, vol. 1965 of Lecture Notes in Computer Science, pp. 277\u2013292. Springer-Verlag, Berlin, Germany, 2000."},{"key":"18_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-39118-5_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 87","author":"H. Sedlak","year":"1988","unstructured":"H. Sedlak. The RSA cryptography processor. In D. Chaum and W. L. Price (eds.), Advances in Cryptology \u2014 EUROCRYPT\u2019 87, vol. 304 of Lecture Notes in Computer Science, pp. 95\u2013105. Springer Verlag, Berlin, Germany, 1988."},{"issue":"8","key":"18_CR25","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1109\/12.156537","volume":"41","author":"N. Takagi","year":"1992","unstructured":"N. Takagi. A radix-4 modular multiplication hardware algorithm for modular exponentiation. IEEE Transactions on Computers, 41(8):949\u2013956, August 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-46766-1_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"C. D. Walter","year":"1992","unstructured":"C. D. Walter. Faster modular multiplication by operand scaling. In J. Feigenbaum (ed.), Advances in Cryptology \u2014 CRYPTO\u2019 91, vol. 576 of Lecture Notes in Computer Science, pp. 313\u2013323. Springer-Verlag, Berlin, Germany, 1992."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T05:23:59Z","timestamp":1550726639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}