Re: A factoring algorithm
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: A factoring algorithm

From: Mike Amling <nospam@foobaz.com>
Date: Mon Jan 09 2006 - 22:35:04 CET

hart_wb@yahoo.com wrote:
> Joseph Ashwood wrote:
>
>><hart_wb@yahoo.com> wrote in message
>>news:1136613824.569396.118650@o13g2000cwo.googlegroups.com...
>>
>>>I have a new factoring algorithm which seems to be very fast with
>>>certain kinds of numbers.
>>
>>Any advances, or even new paths in factoring is always a welcome advance. If
>>your algorithm is as fast as you say, it is likely that new qualifications
>>may need to be created for RSA keys, this is a well established area of
>>advancement, and will be appreciated. Even if it results in triviality as
>>Amling and Carmody have said the knowledge the an additional avenue is
>>available is often very useful.
>> Joe
>
>
> Hi,
>
> thanks for the kind words.
>
> I've been trying today to post a reply to the group, but google groups
> seems to have lost the posts I made.

   Or has it merely delayed them by hours and hours?

--Mike Amling
Received on Tue Jan 17 16:49:20 2006