A faster pseudo-primality test

DOI10.1007/s12215-012-0088-0zbMath1257.11106arXiv1204.1657OpenAlexW3105336851MaRDI QIDQ1758643

Jean-Marc Couveignes, Tony Ezome

Publication date: 15 November 2012

Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1657

zbMATH Keywords

probabilistic algorithmsprimalityMiller-Rabin testGalois theory.

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11) Galois theory and commutative ring extensions (13B05)

Related Items (1)

Fast computation of elliptic curve isogenies in characteristic two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Riemann's hypothesis and tests for primality
• PRIMES is in P
• Separable algebras over commutative rings
• On Ramification Theory in Noetherian Rings
• Proving primality in essentially quartic random time
• Four primality testing algorithms
• Primality Testing and Jacobi Sums
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: A faster pseudo-primality test