A step by step YouTube series with source code that shows how to efficiently implement the quadratic sieve algorithm in Java.

• Episode 1: Fermat's factorization method

  • See where it all started from...

• Episode 2: Congruence of squares

  • Congruence of squares
  • Use a small k multiplier

• Episode 3: Stress tool

• Episode 4: Dixon Method - Part 1

  • Dixon Method

• Episode 5: Dixon Method - Part 2

  • Gaussian Elimination

• Episode 6: Hello Quadratic Sieve

  • Sieving
  • Using logs approximation to faster find bSmooth values

• Episode 7: Sieve Of Eratosthenes

  • A faster way to compute the prime base list

• Episode 8: Continued Factorization

  • Continued Gaussian Elimination, an improved algorithm

• Episode 9: Improving logs

• Episode 10: Multi Polynomial

  • MPQS optimization
  • Ignoring small prime factors to speed up sieving

• Facebook group: https://www.facebook.com/groups/Quadratic.Sieve/

• Facebook page: https://www.facebook.com/QuadraticSieve-115418833588103

• YouTube: https://www.youtube.com/watch?v=DAZi9aGHcD8