new factoring algorithm

From: kooshiar azimian (kooshiar62_at_yahoo.com)
Date: 05/30/03 

Date: 29 May 2003 15:59:31 -0700

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 ?

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)
  • 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)
  • 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)