A probable prime test with very high confidence for \(n \equiv 3\mod4\)

DOI10.1007/S00145-002-0107-YzbMath1041.11083OpenAlexW162865231MaRDI QIDQ1402367

D. Massart

Publication date: 27 August 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-002-0107-y

zbMATH Keywords

quadratic fieldscombined testsprobabilistic primality tests

Mathematics Subject Classification ID

Cryptography (94A60) Factorization; primality (11A51) Primality (11Y11)

Related Items (1)

An unconditional improvement to the running time of the quadratic Frobenius test

This page was built for publication: A probable prime test with very high confidence for \(n \equiv 3\mod4\)