{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:12:06Z","timestamp":1773234726715,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540265474","type":"print"},{"value":"9783540316848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506157_11","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T18:04:36Z","timestamp":1285524276000},"page":"122-133","source":"Crossref","is-referenced-by-count":10,"title":["Redundant Trinomials for Finite Fields of Characteristic 2"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Doche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology\u00a014(3), 153\u2013176 (2001)","journal-title":"Journal of Cryptology"},{"key":"11_CR2","unstructured":"Brent, R., Zimmermann, P.: Algorithms for finding almost irreducible and almost primitive trinomials. Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, The Fields Institute, Toronto, to be published by the American Mathematical Society. See, http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/richard.brent\/pd\/rpb212.pdf"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44839-X_1","volume-title":"Computational Science and Its Applications - ICCSA 2003","author":"R. Brent","year":"2003","unstructured":"Brent, R., Zimmermann, P.: Random number generators with period divisible by a mersenne prime. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L\u2019Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol.\u00a02667, pp. 1\u201310. Springer, Heidelberg (2003), See, http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/richard.brent\/pd\/rpb211.pdf"},{"key":"11_CR4","unstructured":"Doche, C.: A table of redundant trinomials in characteristic 2 up to the degree 10000. See, http:\/\/www.math.u-bordeaux.fr\/~cdoche\/documents\/redundant.gp.gz"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-56755-1_13","volume-title":"Fifth International Conference on Finite Fields and Applications","author":"G. Frey","year":"2001","unstructured":"Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Jungnickel, D., Niederreiter, H. (eds.) Fifth International Conference on Finite Fields and Applications, pp. 128\u2013161. Springer, Berlin (2001)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over F2 (1996)","DOI":"10.1145\/236869.236882"},{"key":"11_CR7","unstructured":"von zur Gathen, J., N\u00f6cker, M.: Polynomial and normal bases for finite fields. To appear"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P. Gaudry","year":"2001","unstructured":"Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology\u00a015(1), 19\u201346 (2001), Online publication: August 29 (2001)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jsco.1993.1012","volume":"15","author":"T. Jebelean","year":"1993","unstructured":"Jebelean, T.: An algorithm for exact division. J. Symbolic Computation\u00a015(2), 169\u2013180 (1993)","journal-title":"J. Symbolic Computation"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45353-9_23","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"A. Menezes","year":"2001","unstructured":"Menezes, A., Qu, M.: Analysis of the Weil descent attack of Gaudry, Hess and Smart. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 308\u2013318. Springer, Heidelberg (2001)"},{"key":"11_CR11","unstructured":"Seroussi, G.: Table of low\u2013weight binary irreducible polynomials. Technical Report HPL\u201398\u2013135, Hewlett\u2013Packard (August 1998)"},{"key":"11_CR12","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, ver. 5.3.1"},{"issue":"11","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TC.2002.1047755","volume":"51","author":"H. Wu","year":"2002","unstructured":"Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite field multiplier using redundant representation. IEEE Trans. Computers\u00a051(11), 1306\u20131316 (2002)","journal-title":"IEEE Trans. Computers"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11506157_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:09Z","timestamp":1605643389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506157_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265474","9783540316848"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11506157_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}