Integer Factorization and Discrete Logarithms (Abstract)

Integer factorization and discrete logarithms have been known for a long time as fundamental problems of computational number theory, but the invention of public key cryptography in the 1970s led to a dramatic increase in their perceived importance.