Agrawal, Manindra (2006) Primality tests based on Fermat's Little theorem Lecture Notes in Computer Science, 4308 . pp. 288-293. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/c30n64761w7740...
Related URL: http://dx.doi.org/10.1007/11947950_32
Abstract
In this survey, we describe three algorithms for testing primality of numbers that use Fermat's Little Theorem.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer Berlin / Heidelberg. |
| ID Code: | 20259 |
| Deposited On: | 20 Nov 2010 14:46 |
| Last Modified: | 16 Jul 2012 05:01 |
Repository Staff Only: item control page
