Re: new factoring algorithm

From: Tom St Denis (tomstdenis_at_iahu.ca)
Date: 05/30/03 

Date: Thu, 29 May 2003 23:03:39 GMT

kooshiar azimian wrote:
> We present a new algorithm for factoring extending the idea of
> Quadratic Sieve Factoring we can show that it works faster than
> Quadratic Sieve asymptotically .how can we check our algorithm to see
> its new or not ?

Actually present the algorithm!

Ha, and I didn't even need a Ph.D for that!

Tom

Relevant Pages

  • Re: new factoring algorithm
    ... > Quadratic Sieve Factoring we can show that it works faster than ... > Quadratic Sieve asymptotically .how can we check our algorithm to see ...
    (sci.crypt)
  • new factoring algorithm
    ... We present a new algorithm for factoring extending the idea of ... Quadratic Sieve Factoring we can show that it works faster than ... Quadratic Sieve asymptotically .how can we check our algorithm to see ...
    (sci.crypt)
  • Re: new factoring algorithm
    ... > Quadratic Sieve Factoring we can show that it works faster than ... > Quadratic Sieve asymptotically .how can we check our algorithm to see ...
    (sci.crypt)
  • Re: new factoring algorithm
    ... ]Quadratic Sieve Factoring we can show that it works faster than ... ]Quadratic Sieve asymptotically .how can we check our algorithm to see ...
    (sci.crypt)
  • uRe: implementing the quadratic sieve
    ... > I am trying to write a toy implementation of the quadratic sieve. ... requirement is really only required for optimizing the algorithm. ... of the exponents of the primes in the factor base. ... You should be able to figure out q from the factorization ...
    (comp.programming)