{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:27:26Z","timestamp":1774798046603,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,14]],"date-time":"2013-09-14T00:00:00Z","timestamp":1379116800000},"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":[[2015,3]]},"DOI":"10.1007\/s10623-013-9875-7","type":"journal-article","created":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T09:41:07Z","timestamp":1379065267000},"page":"559-569","source":"Crossref","is-referenced-by-count":5,"title":["Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic"],"prefix":"10.1007","volume":"74","author":[{"given":"Javad","family":"Doliskani","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,14]]},"reference":[{"key":"9875_CR1","unstructured":"Bostan A., Chowdhury M.F.I., van der Hoeven J., Schost \u00c9.: Homotopy methods for multiplication modulo triangular sets. J. Symb. Comput. 46(12), 1378\u20131402 (2011)."},{"key":"9875_CR2","unstructured":"Brent R.P., Kung H.T.: Fast algorithms for manipulating formal power series. J. Assoc. Comput. Mach. 25(4), 581\u2013595 (1978)."},{"key":"9875_CR3","doi-asserted-by":"crossref","unstructured":"Cantor D.G., Kaltofen E.: On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28(7), 693\u2013701 (1991).","DOI":"10.1007\/BF01178683"},{"key":"9875_CR4","unstructured":"Cipolla, M.: Un metodo per la risoluzione della congruenza di secondo grado. Napoli Rend. 9, 153\u2013163 (1903)"},{"key":"9875_CR5","unstructured":"De Feo L., Schost \u00c9.: Fast arithmetics in Artin\u2013Schreier towers over finite fields. J. Symb. Comput. 47(7), 771\u2013792 (2012)."},{"key":"9875_CR6","doi-asserted-by":"crossref","unstructured":"Doliskani J., Schost \u00c9.: Taking roots over high extensions of finite fields. Math. Comput. (to appear) (2012).","DOI":"10.1090\/S0025-5718-2013-02715-9"},{"key":"9875_CR7","unstructured":"Feng W., Nogami Y., Morikawa Y.: A fast square root computation using the Frobenius mapping. In: Information and Communications Security. Lecture Notes in Computer Science, vol. 2836, pp. 1\u201310. Springer, Heidelberg (2003)."},{"key":"9875_CR8","unstructured":"von zur Gathen J., Gerhard J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)."},{"key":"9875_CR9","doi-asserted-by":"crossref","unstructured":"von zur Gathen J., Shoup V.: Computing Frobenius maps and factoring polynomials. Comput. Complex. 2(3):187\u2013224, (1992).","DOI":"10.1007\/BF01272074"},{"key":"9875_CR10","unstructured":"Gaudry P., Schost \u00c9.: Genus 2 point counting over prime fields. J. Symb. Comput. 47(4), 368\u2013400 (2012)."},{"key":"9875_CR11","unstructured":"Kaltofen E., Shoup V.: Fast polynomial factorization over high algebraic extensions of finite fields. In: ISSAC\u201997, pp. 184\u2013188. ACM, New York (1997)."},{"key":"9875_CR12","unstructured":"Kedlaya K.S., Umans C.: Fast polynomial factorization and modular composition. SIAM J. Comput. 40(6), 1767\u20131802 (2011)."},{"key":"9875_CR13","doi-asserted-by":"crossref","unstructured":"Lang S.: Algebra, Graduate Texts in Mathematics vol. 211, 3rd edn. Springer, New York (2002).","DOI":"10.1007\/978-1-4613-0041-0"},{"key":"9875_CR14","unstructured":"Schoof R.: Elliptic curves over finite fields and the computation of square roots mod $$p$$ p . Math. Comput. 44, 483\u2013494 (1985)."},{"key":"9875_CR15","unstructured":"Shanks D.: Five number-theoretic algorithms. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics, pp. 51\u201370 (1972)."},{"key":"9875_CR16","unstructured":"Shoup, V.: A library for doing number theory (NTL). http:\/\/www.shoup.net\/ntl\/ . Accessed July 2013."},{"key":"9875_CR17","unstructured":"Shoup V.: Fast construction of irreducible polynomials over finite fields. J. Symb. Comput. 17(5), 371\u2013391 (1994)."},{"key":"9875_CR18","unstructured":"Tonelli, A. : Bemerkung \u00fcber die Aufl\u00f6sung quadratischer Congruenzen. G\u00f6ttinger Nachrichten, pp. 344\u2013346 (1891)."},{"key":"9875_CR19","doi-asserted-by":"crossref","unstructured":"Wang F., Nogami Y., Morikawa Y.: An efficient square root computation in finite fields $${GF}(p^{2^d})$$ G F ( p 2 d ) . IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A(10), 2792\u20132799 (2005).","DOI":"10.1093\/ietfec\/e88-a.10.2792"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9875-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9875-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9875-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T02:25:40Z","timestamp":1563935140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9875-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,14]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9875"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9875-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,14]]}}}