{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:43:17Z","timestamp":1742384597819,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730736"},{"type":"electronic","value":"9783540730743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73074-3_6","type":"book-chapter","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T11:26:47Z","timestamp":1190287607000},"page":"55-68","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Multiplication Using Type 2 Optimal Normal Bases"],"prefix":"10.1007","author":[{"given":"Joachim","family":"von zur Gathen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamshid","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"U.S. Department of Commerce \/ National Institute of Standards and Technology: Digital Signature Standard (DSS) Federal Information Processings Standards Publication 186-2 (2000)"},{"key":"6_CR2","unstructured":"Fan, H., Hasan, M.A.: Subquadratic multiplication using optimal normal bases. Technical Report cacr2006-26, University of Waterloo, Waterloo (2006)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1006\/jsco.1999.0309","volume":"29","author":"S. Gao","year":"2000","unstructured":"Gao, S., von zur Gathen, J., Panario, D., Shoup, V.: Algorithms for exponentiation in finite fields. Journal of Symbolic Computation\u00a029, 879\u2013889 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","first-page":"311","volume-title":"LATIN \u201995: Theoretical Informatics","author":"S. Gao von","year":"1995","unstructured":"von Gao, S., von zur Gathen, J., Panario, D.: Gauss periods and fast exponentiation in finite fields. In: Baeza-Yates, R.A., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol.\u00a0911, pp. 311\u2013322. Springer, Heidelberg (1995)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00125200","volume":"2","author":"S. Gao","year":"1992","unstructured":"Gao, S., Lenstra Jr., H.W.: Optimal normal bases. Designs, Codes, and Cryptography\u00a02, 315\u2013323 (1992)","journal-title":"Designs, Codes, and Cryptography"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00145-004-0221-0","volume":"18","author":"J. Gathen von zur","year":"2005","unstructured":"von zur Gathen, J., N\u00f6cker, M.: Polynomial and normal bases for finite fields. Journal of Cryptology\u00a018, 313\u2013335 (2005)","journal-title":"Journal of Cryptology"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11693383_25","volume-title":"Selected Areas in Cryptography","author":"J. Gathen von zur","year":"2006","unstructured":"von zur Gathen, J., Shokrollahi, J.: Efficient FPGA-based Karatsuba multipliers for polynomials over $\\mathbb{F}_{2}$ . In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 359\u2013369. Springer, Heidelberg (2006)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Grabbe, C., Bednara, M., Shokrollahi, J., Teich, J., von zur Gathen, J.: FPGA designs of parallel high performance GF(2233) multipliers. In: Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-03), Bangkok, Thailand, vol.\u00a0II, pp. 268\u2013271 (2003)","DOI":"10.1109\/ISCAS.2003.1205958"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TC.2005.120","volume":"54","author":"R. Granger","year":"2005","unstructured":"Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptogaphy in characteristic three. IEEE Transactions on Computers\u00a054, 852\u2013860 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-48059-5_13","volume-title":"Cryptographic Hardware and Embedded Systems","author":"B.S. Kaliski","year":"1999","unstructured":"Kaliski, B.S., Liskov, M.: Efficient Finite Field Basis Conversion Involving Dual Bases. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 135\u2013143. Springer, Heidelberg (1999)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"van Loan, C.: Computational Frameworks for the Fast Fourier Transform. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1992)","DOI":"10.1137\/1.9781611970999"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R.C. Mullin","year":"1989","unstructured":"Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A., Wilson, R.M.: Optimal normal bases in $\\mbox{GF}(p^n)$ . Discrete Applied Mathematics\u00a022, 149\u2013161 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR13","unstructured":"N\u00f6cker, M.: Data structures for parallel exponentiation in finite fields. Doktorarbeit, Universit\u00e4t Paderborn, Germany (2001)"},{"key":"6_CR14","unstructured":"Omura, J.K., Massey, J.L.: Computational method and apparatus for finite field arithmetic. United States Patent vol. 4, pp. 587,627 (1986) (Date of Patent: May 6, 1986)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TC.2002.1004590","volume":"51","author":"A. Reyhani-Masoleh","year":"2002","unstructured":"Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF(2 m ). IEEE Transactions on Computers\u00a051, 511\u2013520 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR16","unstructured":"Shokrollahi, J.: Efficient Implementation of Elliptic Curve Cryptography on FPGAs. PhD thesis, Bonn University, Bonn (2006), http:\/\/hss.ulb.uni-bonn.de\/diss_online\/math_nat_fak\/2007\/shokrollahi_jamshid\/index.htm"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/12.902754","volume":"50","author":"B. Sunar","year":"2001","unstructured":"Sunar, B., Ko\u00e7, \u00c7.K.: An efficient optimal normal basis type II multiplier. IEEE Transactions on Computers\u00a050, 83\u201387 (2001)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR18","first-page":"155","volume":"31","author":"A. Wassermann","year":"1990","unstructured":"Wassermann, A.: Konstruktion von Normalbasen. Bayreuther Math. Schriften\u00a031, 155\u2013164 (1990)","journal-title":"Bayreuther Math. Schriften"},{"key":"6_CR19","unstructured":"Wikipedia: Sierpinski triangle (2006), Webpage http:\/\/en.wikipedia.org\/wiki\/Sierpinski_triangle"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73074-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T03:40:52Z","timestamp":1737430852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73074-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730736","9783540730743"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73074-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}