Euler pseudoprime polynomials and strong pseudoprime polynomials
The subject of primality testing has become very important over the past few decades with a number of important results and concepts being developed. In this very interesting paper, the author uses a particular rank one Drinfeld module defined by M. van der Put to establish an analog of some of these results for \(\mathbb{F}_q[t]\). In particular, the analogs of the Solovay-Strassen and Miller-Rabin tests for primality are established. A drawback, however, is that these tests are not more efficient than Berlekamp's algorithm.
- ELLIPTIC MODULES
- ELLIPTIC MODULES. II
- Euler pseudoprime polynomials and strong pseudoprime polynomials
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Explicit Class Field Theory for Rational Function Fields
- scientific article; zbMATH DE number 418887 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1263887 (Why is no real title available?)
- scientific article; zbMATH DE number 1296376 (Why is no real title available?)
- scientific article; zbMATH DE number 940594 (Why is no real title available?)
- scientific article; zbMATH DE number 953224 (Why is no real title available?)
- scientific article; zbMATH DE number 861252 (Why is no real title available?)
- Symbole de Newton. Symbole de Jacobi-Carlitz
This page was built for publication: Euler pseudoprime polynomials and strong pseudoprime polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587772)