Fast construction of irreducible polynomials over finite fields
- 29 May 2012
- journal article
- research article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 194 (1) , 77-105
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Fast computation of special resultantsJournal of Symbolic Computation, 2006
- Complex Multiplication Structure of Elliptic CurvesJournal of Number Theory, 1996
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristicLecture Notes in Computer Science, 1993
- Finding isomorphisms between finite fieldsMathematics of Computation, 1991
- Algorithms for finite fields1990
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- The Arithmetic of Elliptic Curves1986
- ON THE PROBLEM OF JACOBSTHALDemonstratio Mathematica, 1978
- Abelian varieties over finite fieldsAnnales Scientifiques de lʼÉcole Normale Supérieure, 1969
- Remarque sur une formule de Shimura-TaniyamaInventiones Mathematicae, 1968