Euler pseudoprime polynomials and strong pseudoprime polynomials (Q1587772)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1538398
Language Label Description Also known as
default for all languages
No label defined
    English
    Euler pseudoprime polynomials and strong pseudoprime polynomials
    scientific article; zbMATH DE number 1538398

      Statements

      Euler pseudoprime polynomials and strong pseudoprime polynomials (English)
      0 references
      0 references
      28 February 2001
      0 references
      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.
      0 references
      pseudoprimes
      0 references
      van der Put module
      0 references
      Miller-Rabin test
      0 references
      Solovay-Strassen test
      0 references
      primality testing
      0 references
      rank one Drinfeld module
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references