Journal article
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Abstract
Although a deterministic polytime algorithm for primality testing is now
known, the Rabin-Miller randomized test of primality continues being the most
Authors
Herman G; Soltys M
Journal
, , ,
Publication Date
November 24, 2008