{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:58:19Z","timestamp":1761058699250},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:00:00Z","timestamp":1182816000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2007,7,17]]},"DOI":"10.1007\/s00200-007-0044-y","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T08:15:49Z","timestamp":1182759349000},"page":"391-396","source":"Crossref","is-referenced-by-count":4,"title":["The trace spectra of polynomial bases for $${\\mathbb{F}}_{2^{n}}$$"],"prefix":"10.1007","volume":"18","author":[{"given":"Omran","family":"Ahmadi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,26]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10623-004-4039-4","volume":"37","author":"O. Ahmadi","year":"2005","unstructured":"Ahmadi, O., Menezes, A.: On the number of trace-one elements in polynomial bases for $${\\mathbb{F}}_{2^{n}}$$ . Designs Codes Cryptogr. 37, 493\u2013507 (2005)","journal-title":"Designs Codes Cryptogr."},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-57936-2_27","volume":"793","author":"I. Blake","year":"1994","unstructured":"Blake I., Gao S., Lambert R. (1994). Constructive problems for irreducible polynomials over finite fields. Information theory and applications. Lect Notes Comput. Sci. 793: 1\u201323","journal-title":"Lect Notes Comput. Sci."},{"key":"44_CR3","volume-title":"Random Graphs","author":"B. Bollobas","year":"1985","unstructured":"Bollobas, B.: Random Graphs. Academic, London (1985)"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong K., Hankerson D., L\u00f3pez J., Menezes A. (2004). Field inversion and point halving revisited. IEEE Trans. Comput. 53: 1047\u20131059","journal-title":"IEEE Trans. Comput."},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Gong, G., Berson, T., Stinson, D.: Elliptic curve pseudorandom sequence generators. Selected Areas in Cryptography\u2014SAC \u201999. Lecture Notes in Computer Science, vol. 1758, pp. 34\u201348 (2000)","DOI":"10.1007\/3-540-46513-8_3"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"2837","DOI":"10.1109\/TIT.2002.804043","volume":"48","author":"G. Gong","year":"2002","unstructured":"Gong G., Youssef A. (2002). Cryptographic properties of the Welch\u2013Gong transformation sequence generators. IEEE Trans. Inf. Theory 48: 2837\u20132846","journal-title":"IEEE Trans. Inf. Theory"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Knudsen, E.: Elliptic scalar multiplication using point halving. Advances in Cryptology\u2014ASIACRYPT \u201999. Lecture Notes in Computer Science 1716, pp. 135\u2013149 (1999)","DOI":"10.1007\/978-3-540-48000-6_12"},{"key":"44_CR8","volume-title":"Finite Fields","author":"R. Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H. (1997). Finite Fields. University Press, Cambridge"},{"key":"44_CR9","unstructured":"Schroeppel, R.: Elliptic curve point halving wins big. In: 2nd Midwest Arithmetical Geometry in Cryptography Workshop, Urbana (2000)"},{"key":"44_CR10","unstructured":"Seroussi, G.: Table of low-weight binary irreducible polynomials. Tech. Rep. HPL-98-135. Hewlett-Packard (1998)"},{"key":"44_CR11","first-page":"100","volume":"23","author":"I.E. Shparlinski","year":"1987","unstructured":"Shparlinski I.E. (1987). On primitive polynomials (in Russian). Problemy Peredachi Inform 23: 100\u2013103","journal-title":"Problemy Peredachi Inform"},{"key":"44_CR12","first-page":"177","volume":"18","author":"I.E. Shparlinski","year":"2005","unstructured":"Shparlinski, I.E.: On the number of zero trace elements in polynomial bases for $${\\mathbb{F}}_{2}n$$ . Rev. Matem\u00e1tica Complutense. 18, 177\u2013180 (2005)","journal-title":"Rev. Matem\u00e1tica Complutense."},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.2140\/pjm.1962.12.1099","volume":"12","author":"R.G. Swan","year":"1962","unstructured":"Swan R.G. (1962). Factorization of polynomials over finite fields. Pacific J. Math. 12: 1099\u20131106","journal-title":"Pacific J. Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0044-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-007-0044-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0044-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:20Z","timestamp":1558610660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-007-0044-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,26]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,7,17]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s00200-007-0044-y","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,26]]}}}