Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It
discusses the basic algorithms for manipulating polynomials including factoring …

Let GF (p) be the finite field with p'~ elements where p is prime. We consider the problem of
how to deterministically generate in polynomial time a subset of GF (pn) that contains a …

Le calcul formel traite des objets mathématiques exacts d'un point de vue informatique. Cet
ouvrage «Algorithmes efficaces en calcul formel» explore deux directions: la calculabilité et …

Factoring Polynomials Over Finite Fields: A Survey Page 1 doi:10.1006/jsco.1999.1002
Available online at http://www.idealibrary.com on J. Symbolic Computation (2001) 31, 3–17 …

ALGORITHMS INVENTED IN THE PAST 25 YEARS make it possible on a computer to
efficiently factor a polynomial in one, several, or many variables with coefficients from a …

Bibliography Page 1 Bibliography [1] Abel-Hollinger, CS, Zimmer, HG: Torsion groups of elliptic
curves with integral j-invariant over multiquadratic fields. In: Proceedings of the Int. Conf …

This conference (ANTS-I) marks the beginning of what we hope will be a long series of
international conferences on algorithmic number theory. It seems appropropriate, at the …

This paper is a report on algorithms to solve problems in number theory. I believe the most
interesting such problems to be those from elementary number theory whose complexity is …

In modern as well as ancient ciphers of public key cryptography, substitution boxes find a
permanent seat. Generation and cryptanalysis of 4-bit as well as 8-bit crypto S-boxes is of …

We design new deterministic algorithms, based on Graeffe transforms, to compute all the
roots of a polynomial which splits over a finite field F _q F q. Our algorithms were designed …