Search results

...number theory. For example, the hardness of RSA is related to the integer factorization problem, while Diffie-Hellman and DSA are related to the discrete logarithm ...onal difficulty of various problems. The most famous of these is [[integer factorization]] (eg, the RSA algorithm is based on a problem related to factoring), but t ...