Fast construction of irreducible polynomials over finite fields-Reference-Cited by-同舟云学术

Fast construction of irreducible polynomials over finite fields

Published:2012-05-29 Issue:1 Volume:194 Page:77-105
ISSN:0021-2172
Container-title:Israel Journal of Mathematics
language:en
Short-container-title:Isr. J. Math.

Author:

Couveignes Jean-Marc,Lercier Reynald

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11856-012-0070-8.pdf

Reference26 articles.

1. L.M. Adleman and H. W. Lenstra, Jr., Finding irreducible polynomials over finite fields, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, ACM, Boston, MA, 1983, pp. 350–355.

2. M. Ben-Or, Probabilistic algorithms in finite fields, 22nd Annual Symposium on Foundations of Computer Science 11 (1981), 394–398.

3. A. Bostan, Ph. Flajolet, B. Salvy and É. Schost, Fast computation of special resultants, Journal of Symbolic Computation 41 (2006), 1–29.

4. A. Bostan, L. González-Vega, H. Perdry and É. Schost, From Newton sums to coefficients: complexity issues in characteristic p, Proceedings of MEGA’05, 2005.

5. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, second edition, Cambridge University Press, 2003.

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

1. Bivariate polynomial reduction and elimination ideal over finite fields;Journal of Symbolic Computation;2025-03

2. Iterative constructions of irreducible polynomials from isogenies;Finite Fields and Their Applications;2024-08

3. Elimination ideal and bivariate resultant over finite fields;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

4. Breaking SIDH in Polynomial Time;Advances in Cryptology – EUROCRYPT 2023;2023

5. Fast computation of elliptic curve isogenies in characteristic two;Journal of the London Mathematical Society;2021-06-30