{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:06Z","timestamp":1725488346135},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_25","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"363-378","source":"Crossref","is-referenced-by-count":8,"title":["Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)"],"prefix":"10.1007","author":[{"given":"Christof","family":"Paar","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Soria-Rodriguez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew directions in cryptography,\u201d IEEE Transactions on Information Theory, vol. IT-22, pp. 644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"25_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, \u201cA public-key cryptosystem and a signature scheme based on discrete logarithms,\u201d IEEE Transactions on Information Theory, vol. IT-31, no. 4, pp. 469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR3","first-page":"417","volume-title":"Lecture Notes in Computer Science 218: Advances in Cryptology \u2014 CRYPTO\u2019 85","author":"V. Miller","year":"1986","unstructured":"V. Miller, \u201cUses of elliptic curves in cryptography,\u201d in Lecture Notes in Computer Science 218: Advances in Cryptology \u2014 CRYPTO\u2019 85, pp. 417\u2013426, Springer-Verlag, Berlin, 1986."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"N. Koblitz, \u201cHyperelliptic cryptosystems,\u201d Journal of Cryptology, vol. 1, no. 3, pp. 129\u2013150, 1989.","journal-title":"Journal of Cryptology"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"L. Adleman and J. DeMarrais, \u201cA subexponential algorithm for discrete logarithms over all finite fields,\u201d in Advances in Cryptography \u2014 CRYPTO\u2019 93, pp. 147\u2013158, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-48329-2_13"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/3-540-48071-4_22","volume-title":"Lecture Notes in Computer Science 453: Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D. Gordon","year":"1993","unstructured":"D. Gordon and K. McCurley, \u201cMassively parallel computation of discrete logarithms,\u201d in Lecture Notes in Computer Science 453: Advances in Cryptology \u2014 CRYPTO\u2019 92 (E. Brickell, ed.), pp. 312\u2013323, Springer-Verlag, Berlin, August 1993."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"A. Menezes, Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"25_CR8","volume-title":"VLSI Architectures for Computation in Galois Fields","author":"E. Mastrovito","year":"1991","unstructured":"E. Mastrovito, VLSI Architectures for Computation in Galois Fields. PhD thesis, Link\u00f6ping University, Dept. Electr. Eng., Link\u00f6ping, Sweden, 1991."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"G. Harper, A. Menezes, and S. Vanstone, \u201cPublic-key cryptosystems with very small key lengths,\u201d in Advances in Cryptology \u2014 EUROCRYPT\u2019 92, pp. 163\u2013173, May 1992.","DOI":"10.1007\/3-540-47555-9_14"},{"key":"25_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Asiacrypt\u2019 96","author":"E. D. Win","year":"1996","unstructured":"E. D. Win, A. Bosselaers, S. Vandenberghe, P. D. Gersem, and J. Vandewalle, \u201cA fast software implementation for arithmetic operations in GF(2n),\u201d in Asiacrypt\u2019 96, Springer Lecture Notes in Computer Science, 1996."},{"key":"25_CR11","volume-title":"Efficient algorithms for implementing elliptic curve public-key schemes","author":"D. Beauregard","year":"1996","unstructured":"D. Beauregard, \u201cEfficient algorithms for implementing elliptic curve public-key schemes,\u201d Master\u2019s thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, Massachusetts, May 1996."},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-51083-4_67","volume-title":"VLSI design for multiplication over finite fields GF(2m)","author":"E. Mastrovito","year":"1989","unstructured":"E. Mastrovito, \u201cVLSI design for multiplication over finite fields GF(2m),\u201d in Lecture Notes in Computer Science 357, pp. 297\u2013309, Springer-Verlag, Berlin, March 1989."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/12.156539","volume":"41","author":"M. Hasan","year":"1992","unstructured":"M. Hasan, M. Wang, and V. Bhargava, \u201cModular construction of low complexity parallel multipliers for a class of finite fields GF(2m),\u201d IEEE Transactions on Computers, vol. 41, pp. 962\u2013971, August 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/12.485570","volume":"45","author":"S. Fenn","year":"1996","unstructured":"S. Fenn, M. Benaissa, and D. Taylor, \u201cGF(2m) multiplication and division over the dual base,\u201d IEEE Transactions on Computers, vol. 45, pp. 319\u2013327, March 1996.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR15","first-page":"1989","volume":"C-38","author":"G. Feng","year":"1989","unstructured":"G. Feng, \u201cA VLSI architecture for fast inversion in GF(2m),\u201d IEEE Transactions on Computers, vol. C-38, p. 1989, Oct 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR16","first-page":"37","volume":"E 72","author":"M. Morii","year":"1989","unstructured":"M. Morii and M. Kasahara, \u201cEfficient construction of gate circuit for computing multiplicative inverses over GF(2m),\u201d Transactions of the IEICE, vol. E 72, pp. 37\u201342, January 1989.","journal-title":"Transactions of the IEICE"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/92.486087","volume":"4","author":"S. Fenn","year":"1996","unstructured":"S. Fenn, M. Benaissa, and D. Taylor, \u201cFinite field inversion over the dual base,\u201d IEEE Transactions on VLSI Systems, vol. 4, pp. 134\u2013136, March 1996.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"25_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/BFb0030378","volume-title":"Advances in Cryptology \u2014 AUSCRYPT\u2019 90","author":"W. Geiselmann","year":"1990","unstructured":"W. Geiselmann and D. Gollmann, \u201cVLSI design for exponentiation in GF(2n),\u201d in Lecture Notes in Computer Science 453: Advances in Cryptology \u2014 AUSCRYPT\u2019 90 (J. Seberry and J. Pieprzyk, eds.), (Sydney, Australia), pp. 398\u2013405, Springer-Verlag, Berlin, January 1990."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/12.45211","volume":"C-39","author":"C. Wang","year":"1990","unstructured":"C. Wang and D. Pei, \u201cA VLSI design for computing exponentiation in GF(2m) and its application to generate pseudorandom number sequences,\u201d IEEE Transactions on Computers, vol. C-39, pp. 258\u2013262, February 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"1984","DOI":"10.1049\/el:19921272","volume":"28","author":"M. Hasan","year":"1992","unstructured":"M. Hasan and V. Bhargava, \u201cLow complexity architecure for exponentiation in GF(2m),\u201d Electronics Letters, vol. 28, pp. 1984\u201386, October 1992.","journal-title":"Electronics Letters"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/12.2212","volume":"37","author":"I. Hsu","year":"1988","unstructured":"I. Hsu, T. Truong, L. Deutsch, and I. Reed, \u201cA comparison of VLSI architecture of finite field multipliers using dual-, normal-, or standard bases,\u201d IEEE Transactions on Computers, vol. 37, pp. 735\u2013739, June 1988.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Y. Jeong and W. Burleson, \u201cChoosing VLSI algorithms for finite field arithmetic,\u201d in IEEE Symposium on Circuits and Systems, ISCAS 92, 1992.","DOI":"10.1109\/ISCAS.1992.230101"},{"key":"25_CR23","unstructured":"C. Paar and N. Lange, \u201cA comparative VLSI synthesis of finite field multipliers,\u201d in 3rd International Symposium on Communication Theory and its Applications, (Lake District, UK), July 10\u201314 1995."},{"key":"25_CR24","first-page":"63","volume":"3","author":"G. Agnew","year":"1991","unstructured":"G. Agnew, R. Mullin, I. Onyschuk, and S. Vanstone, \u201cAn implementation for a fast public-key cryptosystem,\u201d Journal of Cryptography, vol. 3, pp. 63\u201379, 1991.","journal-title":"Journal of Cryptography"},{"key":"25_CR25","volume-title":"Algorithmenentwurf in der Kryptographie","author":"W. Gollmann","year":"1990","unstructured":"W. Gollmann, \u201cAlgorithmenentwurf in der Kryptographie.\u201d Habilitation, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Germany, August 1990."},{"issue":"1","key":"25_CR26","first-page":"102","volume":"15","author":"K. Yiu","year":"1982","unstructured":"K. Yiu and K. Peterson, \u201cA single-chip VLSI implementation of the discrete exponential public-key distribution system,\u201d IBM Systems Journal, vol. 15, no. 1, pp. 102\u2013116, 1982.","journal-title":"IBM Systems Journal"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G. Agnew","year":"1993","unstructured":"G. Agnew, R. Mullin, and S. Vanstone, \u201cAn implementation of elliptic curve cryptosystems over % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbd9wDYLwzYbItLDharyavP1wz % ZbItLDhis9wBH5garqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaabeqaam % aaeaqbaaGcbaacbiGae8Nray0aaSbaaSqaaGqaaiab+jdaYmaaCaaa % meqabaGae4xmaeJae4xnauJae4xnaudaaaWcbeaaaaa!3FFF! $$ F_{2^{155} } $$ ,\u201d IEEE Journal on Selected areas in Communications, vol. 11, pp. 804\u2013813, June 1993.","journal-title":"IEEE Journal on Selected areas in Communications"},{"key":"25_CR28","volume-title":"Error Control Coding: Fundamentals and Applications","author":"S. Lin","year":"1983","unstructured":"S. Lin and D. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983."},{"key":"25_CR29","unstructured":"N. Weste and K. Eshraghian, Principles of CMOS VLSI Design, A Systems Perspective. Addison-Wesley Publishing Company, second ed., 1992."},{"key":"25_CR30","volume-title":"Encyclopedia of Mathematics and its Applications","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Mathematics and its Applications. Reading, Massachusetts: Addison-Wesley, 1983."},{"key":"25_CR31","unstructured":"V. Afanasyev, \u201cOn the complexity of finite field arithmetic,\u201d in 5th Joint Soviet-Swedish Intern. Workshop on Information Theory, (Moscow, USSR), pp. 9\u201312, January 1991."},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/12.508323","volume":"45","author":"C. Paar","year":"1996","unstructured":"C. Paar, \u201cA new architecture for a parallel finite field multiplier with low complexity based on composite fields,\u201d IEEE Transactions on Computers, vol. 45, pp. 856\u2013861, July 1996.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR33","volume-title":"Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in Endlichen K\u00f6rpern","author":"W. Geiselmann","year":"1993","unstructured":"W. Geiselmann, Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in Endlichen K\u00f6rpern. PhD thesis, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Algorithmen und Kognitive Systeme, Karlsruhe, Germany, 1993."},{"key":"25_CR34","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. Mullin","year":"1988","unstructured":"R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, \u201cOptimal normal bases in GF(p n ),\u201d Discrete Applied Mathematics, North Holland, vol. 22, pp. 149\u2013161, 1988\/89.","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR35","volume-title":"The Art of Computer Programming. Volume 2: Seminumerical Algorithms","author":"D. Knuth","year":"1981","unstructured":"D. Knuth, The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Reading, Massachusetts: Addison-Wesley, 2nd ed., 1981.","edition":"2nd ed."},{"key":"25_CR36","unstructured":"M. Lehky, M. Nappi, and P. Soria-Rodriguez, \u201cCoprocessor board for cryptographic applications.\u201d Major Qualifying Project (Senior Thesis), 1996. ECE Dept., Worcester Polytechnic Institute."},{"key":"25_CR37","volume-title":"Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen","author":"A.-M. Spallek","year":"1994","unstructured":"A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, July 1994."},{"key":"25_CR38","volume-title":"Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ordnungen \u00fcber Hauptidealringen","author":"S. Paulus","year":"1996","unstructured":"S. Paulus, Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ordnungen \u00fcber Hauptidealringen. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1996."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:31:56Z","timestamp":1556724716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}