An Introduction to the General Number Field Sieve

This work addresses the concern that the security value of the RSA system would be nullified if an efficient algorithm is developed that can factor any arbitrarily large integer in a " reasonable amount of time" by first pulling together much of the background information necessary to understand the concepts that are central in the General Number Field Sieve.