Algorithm for quick Fermat test ?
- From: "Dilbertarian" <jacques_dilbert@xxxxxxxxxxx>
- Date: 19 Oct 2006 12:40:20 -0700
Is there a specific algorithm for computing 2^(n-1) mod n, faster than
the usual exponentiation by squaring?
The purpose is to do a quick Fermat primality test using base 2 rather
than another number.
.
- Prev by Date: Algorithm for quick Fermat test ?
- Next by Date: Program to decode scytale cypher
- Previous by thread: Re: Algorithm for quick Fermat test ?
- Next by thread: Program to decode scytale cypher
- Index(es):
Relevant Pages
|
