Re: new factoring algorithm

From: Colin Andrew Percival (cperciva_at_sfu.ca)
Date: 05/30/03 

Date: 30 May 2003 00:11:47 GMT

kooshiar azimian <kooshiar62@yahoo.com> 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 ?

  Ideally, post it here; if you don't want to do that, send it to someone
for review. Scott Contini is probably the best person out of the regular
posters here; I could also look at it (and take it to my supervisor if
necessary).

Colin Percival

Relevant Pages

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