Help regarding Quadratic Sieve

39 Views Asked by At

I'm working on a code that recovers/retraces the prime no's from which a 30-digit number was formed. As, this is a factorization problem I have started regarding various algorithms about it. This brought me to Quadratic sieve. I know about the selection of B-smooth value and how to generate prime numbers which are less than B and have their Legendre symbol 1. Its the sieving step that is way more confusing. It would be a great help if anyone could give me a glimpse of it.