Part of the Lecture Notes in Computer Science book series (LNCS, volume 4308)
Primality Tests Based on Fermat’s Little Theorem
In this survey, we describe three algorithms for testing primality of numbers that use Fermat’s Little Theorem.
KeywordsArithmetic Operation Polynomial Time Algorithm Prime Power Prime Divisor Output Prime
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2006