{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:39:36Z","timestamp":1648586376006},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T00:00:00Z","timestamp":1281571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10623-010-9424-6","type":"journal-article","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T10:42:50Z","timestamp":1281523370000},"page":"171-182","source":"Crossref","is-referenced-by-count":0,"title":["An alternative class of irreducible polynomials for optimal extension fields"],"prefix":"10.1007","volume":"60","author":[{"given":"Yin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gong-liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-hua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,12]]},"reference":[{"key":"9424_CR1","unstructured":"Bailey D.V., Paar C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: CRYPTO\u201998: Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, Lecture Notes In Computer Science, vol. 1462, pp. 472\u2013485. Springer-Verlag, London (1998)."},{"key":"9424_CR2","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. J. Cryptol. 14, 153\u2013176 (2001)","journal-title":"J. Cryptol."},{"key":"9424_CR3","unstructured":"Bajard J.C., Imbert L., N\u00e9gre C.: Modular multiplication in GF(p k ) using Lagrange representation. In: Proceedings of the Third International Conference on Cryptology: Progress in Cryptology, Lecture Notes in Computer Science, vol. 2551, pp. 275\u2013284. Springer-Verlag, London (2002)."},{"key":"9424_CR4","unstructured":"Bajard J.C., Imbert L., Jullien G.A., Williams H.C.: A CRT-based Montgomery multiplication for finite fields of small characteristic. In: IMACS\u201905: World Congress: Scientific Computation, Applied Mathematics and Simulation, Paris (France), 11\u201315 July 2005."},{"key":"9424_CR5","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1109\/TC.2006.136","volume":"55","author":"J.C. Bajard","year":"2006","unstructured":"Bajard J.C., Imbert L., N\u00e9gre C.: Arithmetic operations in finite fields of medium prime characteristic using the lagrange representation. IEEE Trans. Comput. 55, 1167\u20131177 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"9424_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1008389508626","volume":"20","author":"A. Halbuto\u01e7ullari","year":"2000","unstructured":"Halbuto\u01e7ullari A., Ko\u00e7 \u00c7.K.: Parallel multiplication in GF(2 k ) using polynomial residue arithmetic. Des. Codes Cryptogr. 20, 155\u2013173 (2000)","journal-title":"Des. Codes Cryptogr."},{"key":"9424_CR7","unstructured":"Knuth D.E.: Seminumerical algorithms. In: Art of Computer Programming, vol. 2, 3rd edn. Addison-Wesley Professional, Reading (1997)."},{"key":"9424_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz N.: Elliptic curve cryptosystems. Math. Comput. 48, 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"9424_CR9","unstructured":"Li Y., N\u00e9gre C.: An efficient multiplication algorithm using binomial residue representation. In: International Conference on Security and Cryptography, SECRYPT 2008, pp. 319\u2013324 (2008)."},{"key":"9424_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R. Lidl","year":"1994","unstructured":"Lidl R., Niederreiter H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, New York, NY, USA (1994)"},{"key":"9424_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511525926","volume-title":"Finite Fields","author":"R. Lidl","year":"1996","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, New York, NY, USA (1996)"},{"key":"9424_CR12","unstructured":"Lim C.H., Hwang H.S.: Fast implementation of elliptic curve arithmetic in GF(p n ). In: PKC \u201900: Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography, pp. 405\u2013421. Springer-Verlag, London (2000)."},{"key":"9424_CR13","unstructured":"Miller V.S.: Uses of elliptic curve in cryptography. In: Advances in Cryptology, Proceedings of CRYPTO\u201986, pp. 417\u2013428 (1986)."},{"key":"9424_CR14","unstructured":"Moenck R.T.: Practical fast polynomial multiplication. In: Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation, SYMSAC \u201976, pp. 136\u2013148. ACM, New York (1976)."},{"key":"9424_CR15","doi-asserted-by":"crossref","unstructured":"Nakajima T., Izu T., Takagi T.: Reduction optimal trinomials for efficient software implementation of the \u03b7T pairing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E91-A(9), 2379\u20132386 (2008).","DOI":"10.1093\/ietfec\/e91-a.9.2379"},{"key":"9424_CR16","doi-asserted-by":"crossref","first-page":"818","DOI":"10.4218\/etrij.08.0108.0178","volume":"30","author":"Y. Nogami","year":"2008","unstructured":"Nogami Y., Kato H., Nekado K., Morikawa Y.: Efficient exponentiation in extensions of finite fields without fast Frobenius mappings. ETRI J. 30, 818\u2013825 (2008)","journal-title":"ETRI J."},{"key":"9424_CR17","volume-title":"Modern Computer Algebra","author":"J. VonZur Gathen","year":"1999","unstructured":"VonZur Gathen J., Gerhard J.: Modern Computer Algebra. Cambridge University Press, New York, NY, USA (1999)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9424-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9424-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9424-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:05:37Z","timestamp":1559405137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9424-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,12]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9424"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9424-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,12]]}}}