|
D.12.3.19 SolowayStrassen
Procedure from library crypto.lib (see crypto_lib).
- Usage:
- SolowayStrassen(n,k);
- Return:
- 1 if n is prime, 0 else
- Note:
- probabilistic test of Soloway-Strassen with k loops to test if n is
prime using the theorem: If n is prime then
powerN(a,(n-1)/2,n)=Jacobi(a,n) mod n
Example:
|