Page 13 - Demo_cryptography

2 Intractable problems in number theory
In this chapter we will talk about two intractable problems in number theory, which are very important for public key cryptosystems: integer factorization problem and discrete logarithm problem.
The integer factorization problem is behind the security of RSA encryption algorithm and discrete logarithm problem is a fundamental part for Digital Signature Algorithm. Thus it is essential to understand them, and then argue about the security of public key crypto systems.