Re: Factorization: a new algorithm??
From: Tom St Denis (tom_at_securescience.net)
Date: 03/28/04
- Next message: Bryan Olson: "Re: A free idea about ideas..."
- Previous message: boufarik: "Factorization: a new algorithm??"
- In reply to: boufarik: "Factorization: a new algorithm??"
- Next in thread: Colin Andrew Percival: "Re: Factorization: a new algorithm??"
- Reply: Colin Andrew Percival: "Re: Factorization: a new algorithm??"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 27 Mar 2004 23:51:16 GMT
boufarik wrote:
> Factorization: a new algorithm
> we will consider only numbers of the form N=6*k+1. The case of numbers
> N=6*k-1 can be reduced to the first case.
Arrg... there should be a 6k-1 FAQ for this group... I nominate Silverman to
write it ;-)
Ok dude, factor a non smoooth [for a bound of 2 <= x <= 2^250] 512-bit
number with your algorithm and I'll consider it "impressive".
If my hunch is correct your algo is just another O(N) algo which not faster
than trial division.
Tom
- Next message: Bryan Olson: "Re: A free idea about ideas..."
- Previous message: boufarik: "Factorization: a new algorithm??"
- In reply to: boufarik: "Factorization: a new algorithm??"
- Next in thread: Colin Andrew Percival: "Re: Factorization: a new algorithm??"
- Reply: Colin Andrew Percival: "Re: Factorization: a new algorithm??"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
Loading