Re: AKS vs. Probabilistic Primality Testing

From: Phil Carmody (thefatphil_demunged_at_yahoo.co.uk)
Date: 04/21/04 

Date: 21 Apr 2004 09:41:15 +0300

"Thiery Balser" <thiery.balser@gmx.net> writes:
> Hi,
>
> I'm wondering whether the algorithm AKS
> (http://mathworld.wolfram.com/AKSPrimalityTest.html) has had any implication
> on practical cryptography, i.e. wheter probalistic primality testing has
> been replaced by the AKS algortihm.
> (For example in public key crypto-systems such as RSA)
>
> I'm really a newbie to this kind of questions, so I hope I'm not asking
> something which is clear to everbody who masters Google (I've tried, but
> couldn't find any useful links).
>
> Any hints, links are highly appreciated!
>
>
> Thanks in advance,

If you absolutely need a definitive answer to the primality question,
then there are more efficient methods than AKS, such as APR-CL or ECPP.

AKS is mathematically extremely interesting, but has no practical use.

Phil 

-- 
1st bug in MS win2k source code found after 20 minutes: scanline.cpp
2nd and 3rd bug found after 10 more minutes: gethost.c
Both non-exploitable. (The 2nd/3rd ones might be, depending on the CRTL)

Relevant Pages
Quantcast