Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic-Reference-Cited by-同舟云学术

Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic

Published:2013-09-14 Issue:3 Volume:74 Page:559-569
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Doliskani Javad,Schost Éric

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-013-9875-7.pdf

Reference19 articles.

1. Bostan A., Chowdhury M.F.I., van der Hoeven J., Schost É.: Homotopy methods for multiplication modulo triangular sets. J. Symb. Comput. 46(12), 1378–1402 (2011).

2. Brent R.P., Kung H.T.: Fast algorithms for manipulating formal power series. J. Assoc. Comput. Mach. 25(4), 581–595 (1978).

3. Cantor D.G., Kaltofen E.: On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28(7), 693–701 (1991).

4. Cipolla, M.: Un metodo per la risoluzione della congruenza di secondo grado. Napoli Rend. 9, 153–163 (1903)

5. De Feo L., Schost É.: Fast arithmetics in Artin–Schreier towers over finite fields. J. Symb. Comput. 47(7), 771–792 (2012).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Algorithms for Solving Equations of Degree $$\boldsymbol{{\leqslant}4}$$ in Some Finite Fields;Moscow University Mathematics Bulletin;2021-05

2. Standard Lattices of Compatibly Embedded Finite Fields;Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation;2019-07-08

3. Computing p th roots in extended finite fields of prime characteristic p ≥ 2;Electronics Letters;2016-04

4. Explicit isogenies in quadratic time in any characteristic;LMS Journal of Computation and Mathematics;2016