Re: new factoring algorithm

From: Bill Unruh (unruh_at_string.physics.ubc.ca)
Date: 05/30/03 

Date: 30 May 2003 00:00:59 GMT

kooshiar62@yahoo.com (kooshiar azimian) writes:

]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 ?

assymptotically the Number field sieve is faster already than the
Quadratic sieve. ( exp(L^1/3 lnL ^2/3) rather than exp( L^1/2 lnL^1/2) where L is
the length of the number if I remeber correctly)

Relevant Pages

  • 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)
  • 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: JSH: What is surrogate factoring? Once more.
    ... central unavoidable problem with the Harris idea. ... As with Fermat's algorithm (and Dixon's, ... that of Dixon or the quadratic sieve method, ...
    (sci.math)
  • 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: JSH: What is surrogate factoring? Once more.
    ... central unavoidable problem with the Harris idea. ... As with Fermat's algorithm (and Dixon's, ... that of Dixon or the quadratic sieve method, ...
    (sci.math)