Euler pseudoprime polynomials and strong pseudoprime polynomials

DOI10.1006/FFTA.1999.0272zbMath0979.11033OpenAlexW2012307189MaRDI QIDQ1587772

Véronique Mauduit

Publication date: 28 February 2001

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1999.0272

zbMATH Keywords

Miller-Rabin testprimality testingrank one Drinfeld modulepseudoprimesSolovay-Strassen testvan der Put module

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Drinfel'd modules; higher-dimensional motives, etc. (11G09) Primality (11Y11)

Related Items (1)

Euler pseudoprime polynomials and strong pseudoprime polynomials

Cites Work

• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Euler pseudoprime polynomials and strong pseudoprime polynomials
• Explicit Class Field Theory for Rational Function Fields
• ELLIPTIC MODULES
• ELLIPTIC MODULES. II
• Symbole de Newton. Symbole de Jacobi-Carlitz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Euler pseudoprime polynomials and strong pseudoprime polynomials