{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:04:54Z","timestamp":1742396694521},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137969"},{"type":"electronic","value":"9783642137976"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13797-6_4","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T10:49:56Z","timestamp":1277376596000},"page":"41-61","source":"Crossref","is-referenced-by-count":12,"title":["Type-II Optimal Polynomial Bases"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Bailey, D.V., Batina, L., Bernstein, D.J., Birkner, P., Bos, J.W., Chen, H.-C., Cheng, C.-M., van Damme, G., de Meulenaer, G., Dominguez Perez, L.J., Fan, J., G\u00fcneysu, T., Gurkaynak, F., Kleinjung, T., Lange, T., Mentens, N., Niederhagen, R., Paar, C., Regazzoni, F., Schwabe, P., Uhsadel, L., Van Herrewege, A., Yang, B.-Y.: Breaking ECC2K-130. Cryptology ePrint Archive, Report 2009\/541 (2009), http:\/\/eprint.iacr.org\/2009\/541"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03356-8_19","volume-title":"CRYPTO 2009","author":"D.J. Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Batch binary Edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 317\u2013336. Springer, Heidelberg (2009)"},{"key":"4_CR3","unstructured":"Bernstein, D.J.: Optimizing linear maps modulo 2. In: Workshop Record of SPEED-CC: Software Performance Enhancement for Encryption and Decryption and Cryptographic Compilers, pp. 3\u201318 (2009), http:\/\/cr.yp.to\/papers.html#linearmod2"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1515\/dma.2001.11.4.327","volume":"11","author":"A.A. Bolotov","year":"2001","unstructured":"Bolotov, A.A., Gashkov, S.B.: On a quick multiplication in normal bases of finite fields. Discrete Mathematics and Its Applications\u00a011, 327\u2013356 (2001)","journal-title":"Discrete Mathematics and Its Applications"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A.T. Brauer","year":"1939","unstructured":"Brauer, A.T.: On addition chains. Bulletin of the American Mathematical Society\u00a045, 736\u2013739 (1939)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"4_CR6","unstructured":"Certicom. Certicom ECC challenge (1997), http:\/\/www.certicom.com\/images\/pdfs\/cert_ecc_challenge.pdf"},{"key":"4_CR7","unstructured":"Clift, N.: Hansen chains do not always produce optimum addition chains. Posting to sci.math (July 31, 2005), http:\/\/sci.tech-archive.net\/Archive\/sci.math\/2005-08\/msg00447.html"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Fan, J., Bailey, D.V., Batina, L., G\u00fcneysu, T., Paar, C., Verbauwhede, I.: Breaking elliptic curves cryptosystems using reconfigurable hardware (2010)","DOI":"10.1109\/FPL.2010.34"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TC.2007.1076","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases. IEEE Transactions on Computers\u00a056, 1435\u20131437 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-59175-3_98","volume-title":"LATIN \u201995: Theoretical Informatics","author":"S. Gao","year":"1995","unstructured":"Gao, S., von zur Gathen, J., Panario, D.: Gauss periods and fast exponentiation in finite fields (extended abstract). In: Baeza-Yates, R.A., Goles, E., Poblete, P.V. (eds.) LATIN 1995. LNCS, vol.\u00a0911, pp. 311\u2013322. Springer, Heidelberg (1995)"},{"issue":"6","key":"4_CR11","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(6), 879\u2013889 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1515\/crll.1959.202.129","volume":"202","author":"W. Hansen","year":"1959","unstructured":"Hansen, W.: Zum Scholz\u2013Brauerschen Problem. Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal)\u00a0202, 129\u2013136 (1959) (in German)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases. Information and Computation\u00a078(3), 171\u2013177 (1988)","journal-title":"Information and Computation"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"T. Itoh","year":"1989","unstructured":"Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of fields GF(2 m ). Information and Computation\u00a083(1), 21\u201340 (1989)","journal-title":"Information and Computation"},{"key":"4_CR15","series-title":"Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The art of computer programming, volume 1: Fundamental algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, volume 1: Fundamental algorithms, 3rd edn. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Company, Reading (1997)","edition":"3"},{"key":"4_CR16","series-title":"Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The art of computer programming, volume 2: Seminumerical algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming, volume 2: Seminumerical algorithms, 3rd edn. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Company, Reading (1997)","edition":"3"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"4_CR18","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 GF(p n ). Discrete Applied Mathematics\u00a022(2), 149\u2013161 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR19","unstructured":"N\u00f6cker, M.: Data structures for parallel exponentiation in finite fields. PhD thesis, Universit\u00e4t Paderborn (2001), http:\/\/math-www.uni-paderborn.de\/~aggathen\/Publications\/noc01.ps"},{"key":"4_CR20","unstructured":"Shokrollahi, J.: Efficient implementation of elliptic curve cryptography on FPGAs. PhD thesis, Universit\u00e4t Bonn (2007), http:\/\/hss.ulb.uni-bonn.de\/diss_online\/math_nat_fak\/2007\/shokrollahi_jamshid\/0960.pdf"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., N\u00f6cker, M.: Computing special powers in finite fields (extended abstract). In: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201999, Vancouver, B.C., Canada, July 29\u201331, pp. 83\u201390 (1999)","DOI":"10.1145\/309831.309869"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-73074-3_6","volume-title":"Arithmetic of Finite Fields","author":"J. Gathen von zur","year":"2007","unstructured":"von zur Gathen, J., Shokrollahi, A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 55\u201368. Springer, Heidelberg (2007)"}],"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-642-13797-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:39Z","timestamp":1606185819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13797-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137969","9783642137976"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13797-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}