--- pharishkumar <pharishkumar@...
> Did anybody look at the implementation of aks algorithm using Ntl
> library..I found one implemenation at
> but the problem is ,while execution its take long time for small
> prime numbers too..could any body help me,how exactly the algorithm
> works for given input(atleast 10 digit input)..and what are the
> changes to made for above c code..
There are no changes to be made. That implementation is probably one of the
best ones there is. Noone said it was fast, it was simply in P.
(See Paul Leyland's last but one paragraph.)
I Pledge Allegiance to the flag
That appears on my Desktop Startup Screen.
And to the Monopoly for which it Stands:
One Operating System over all, inescapable,
With Freedom and Privacy for none. -- Telecommando on /.
Do you Yahoo!?
Yahoo! Mail Plus - Powerful. Affordable. Sign up now.