A faster pseudo-primality test

Abstract : We propose a pseudo-primality test using cyclic extensions of $Z/nZ$. For every positive integer $k$ this test achieves the security of $k^2$ Miller-Rabin tests at the cost of $k^{1+o(1)}$ Miller-Rabin tests.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00694113
Contributor : Marie-Annick Guillemer <>
Submitted on : Thursday, May 3, 2012 - 3:29:21 PM
Last modification on : Friday, April 12, 2019 - 4:22:50 PM

Links full text

Identifiers

Citation

Jean-Marc Couveignes, Tony Ezome, Reynald Lercier. A faster pseudo-primality test. Rendiconti del Circolo Matematico di Palermo, 2012, 61 (2), pp.261-278. ⟨10.1007/s12215-012-0088-0⟩. ⟨hal-00694113⟩

Share

Metrics

Record views

958