- ... meant4.1
- This quote is on page 265 of the first
edition. In the second edition, on page 303, this sentence is
changed to ``The obvious mathematical breakthrough that would defeat
our public key encryption would be the development of an easy way to
factor large numbers.'' This is less nonsensical; however, fast
factoring is not known to break all commonly used public-key
cryptosystem. For example, there are cryptosystems based on the
difficulty of computing discrete logarithms in
and on
elliptic curves over
, which (presumably) would not be broken
even if one could factor large numbers quickly.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...5.1
- Proof from [SD01, pg. 13].
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... jobs20.1
- From The Education of T.C. MITS (1942).
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.