removed mistake on factoring vs DLP with RSA/DH. completely forgot that. thanks to...
authorAaron Zauner <azet@azet.org>
Wed, 11 Dec 2013 23:07:04 +0000 (00:07 +0100)
committerAaron Zauner <azet@azet.org>
Wed, 11 Dec 2013 23:07:04 +0000 (00:07 +0100)
src/ECC.tex

index 2b6c12d..2ebd986 100644 (file)
@@ -2,10 +2,10 @@
 \label{section:EllipticCurveCryptography}
 
 Elliptic Curve Cryptogaphy (simply called ECC from now on) is a branch of 
-cryptography that emerged in the mid-1980ties. The security of the RSA and 
-Diffie-Hellman algorithms is based on the assumption that factoring large 
-primes is infeasable. Likewise the security of ECC is based on the discrete 
-logarithm problem
+cryptography that emerged in the mid-1980ties.
+The security of the RSA algorithm is based on the assumption that factoring 
+large primes is infeasible. Likewise the security of ECC, DH and DSA is 
+based on the discrete logrithm problem.
 \footnote{\url{http://www.mccurley.org/papers/dlog.pdf}} 
 \footnote{\url{http://en.wikipedia.org/wiki/Discrete\_logarithm}}
 \footnote{\url{http://mathworld.wolfram.com/EllipticCurve.html}}.