From: Aaron Zauner
Date: Tue, 24 Dec 2013 16:39:41 +0000 (+0100)
Subject: s/numbers/primes/
X-Git-Url: https://git.bettercrypto.org/ach-master.git/commitdiff_plain/ca68b044109a17595365975b28029723fd233d48
s/numbers/primes/
---
diff --git a/src/theory/ECC.tex b/src/theory/ECC.tex
index 324ec8c..708b7c6 100644
--- a/src/theory/ECC.tex
+++ b/src/theory/ECC.tex
@@ -10,7 +10,7 @@ exceptions.''}{-- Felix Klein }
\todo{cm says: factoring primes is impossible by definition!}
Elliptic Curve Cryptography (simply called ECC from now on) is a branch of
cryptography that emerged in the mid-1980s. The security of the RSA
-algorithm is based on the assumption that factoring large primes is infeasible.
+algorithm is based on the assumption that factoring large numbers is infeasible.
Likewise, the security of ECC, DH and DSA is based on the discrete logarithm
problem\cite{Wikipedia:Discrete,McC90,WR13}. Finding the discrete logarithm of
an elliptic curve from its public base point is thought to be infeasible. This