Large Primes

[James Radley]

It was discussed on slashdot too.

The interesting opinions on /. said that this is not going to crack 
anything like RSA in warp speed time. We already know about whether they 
key is composite or prime ( it's a composite of two primes ). The major 
effort in cracking the key is to break the composite down into it's two 
prime factors.

This algorithm doesn't do that.

James

On Saturday, August 10, 2002, at 02:01  pm, David Singleton wrote:

>
> AFAICT, the paper you're referring to is this one:
> http://www.cse.iitk.ac.in/primality.pdf
>
> Abstract:
> "We present a deterministic polynomial-time algorithm that determines
> whether an input number n is prime or composite"
>
> Certainly very interesting - I haven't had a chance to read it fully 
> yet.
>
> The time bound which they present is O((log n)^12) although they suggest
> that it should acheive O((log n)^6) in practice.
>
> David
>
> --
>
> David Singleton  +44(0)7980 641608  http://www.davidsingleton.co.uk/
>
>
>> -----Original Message-----
>> From: ukcrypto-admin@chiark.greenend.org.uk
>> [mailto:ukcrypto-admin@chiark.greenend.org.uk]On Behalf Of Owen Lewis
>> Sent: 10 August 2002 13:37
>> To: Ukcrypto@Chiark. Greenend. Org. Uk
>> Subject: Large Primes
>>
>>
>> Can anyone follow-up on a piece in this morning's Today programme about
>> large primes? It seems that a group of Indian mathematicians have
>> published
>> their discovery of a method for rapidly determining whether a large 
>> number
>> is a prime factor.
>>
>> Owen
>>
>>
>>
>> --
>> This email was forwarded via the University of Cambridge alumni
>> email system
>> Visit http://cantab.net/ to update your forwarding details
>>
>
>