ABSTRACT
Many modern algorithms for factoring and computing discrete logarithms in finite fields heavily rely on sieving in practical implementations1. These index calculus algorithms themselves are described in the applications part of this book, more precisely in Chapter 15. We chose to present the sieve algorithms in the present chapter in order to focus on the variety of possible implementations and available trade-offs.
