Help with Gaussian elimination mod 2 in the Quadratic Sieve
Thats true but I am writing this as part of my course work and I am
supposed to implement Dixon's Quadratic Sieve.
--- In firstname.lastname@example.org, "elevensmooth"
> --- In email@example.com, "vijaysomu" <vijaysomu@y...>It
> > I am writing a java program to factor large number
> Are you aware of Dario Alejandro Alpern's Java Factoring program?
> does algebraic factorization, then Cunningham Lookup, then trialnumbers,
> factorization, then ECM, and finally, for sufficiently small
> finishes with SIQS. He's been optimizing the code, so it's fast.It
> handles numbers up to 10,000 digits.
> ElevenSmooth: Distributed Factoring of 2^3326400-1