|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
February 21st, 2006, 03:35 AM
|
|||
|
|||
|
AKS primality Testing
hi
i am trying to solve the primality testing algorithm. But i am stucked with the exponentiation i need c or c++ code for exponentiation like (1+x)^m (mod n, x^r-a) can anyone please help me regarding it?? do reply soon atleast tell me someone who can solve this?? Thanks Bye Swapnil
|
|
| Viewing: Dev Shed Forums > System Administration > Security and Cryptography > AKS primality Testing |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
