Download Elementary Number Theory

Document related concepts

Mathematical proof wikipedia , lookup

Mathematics of radio engineering wikipedia , lookup

Georg Cantor's first set theory article wikipedia , lookup

Vincent's theorem wikipedia , lookup

Addition wikipedia , lookup

Four color theorem wikipedia , lookup

Collatz conjecture wikipedia , lookup

Brouwer fixed-point theorem wikipedia , lookup

List of prime numbers wikipedia , lookup

Factorization of polynomials over finite fields wikipedia , lookup

System of polynomial equations wikipedia , lookup

Elementary mathematics wikipedia , lookup

List of important publications in mathematics wikipedia , lookup

Factorization wikipedia , lookup

Fundamental theorem of calculus wikipedia , lookup

Theorem wikipedia , lookup

Wiles's proof of Fermat's Last Theorem wikipedia , lookup

Number theory wikipedia , lookup

Fundamental theorem of algebra wikipedia , lookup

Quadratic reciprocity wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Transcript
10. Applications in Cryptography
89
in a moment the map ()e : Z/nZ → Z/nZ is indeed injective so that
x = mj is the only solution. The security of the RSA cryptosystem
is based on the assumption that the most efficient procedure to solve
cj ≡ xe mod n is to calculate ϕ(n), and then d such that ed ≡ 1 mod
ϕ(n) (recall that e was chosen relatively prime to ϕ(n)). Namely then
cdj ≡ xed ≡ x mod n.
The second congruence, for x relatively prime to n, follows on writing
ed = 1 + tϕ(n) for some integer t, and using Euler’s theorem which
ensures xϕ(n) ≡ 1 mod n. We leave it to the reader to show that
the congruence xed ≡ x mod n remains true if x is not relatively
prime to n. The exponent d is quickly calculated using the extended
Euclidean algorithm. However, for this we need ϕ(n), which is kept
as a secret by A. Knowing ϕ(n) is essentially equivalent to knowing
the factorization of n. Indeed, ϕ(n) = (p − 1)(q − 1), and if we know
ϕ(n) we can calculate p and q as zeros of
(y − p)(y − q) = y 2 + (ϕ(n) − n − 1)y + n = 0,
i.e. as
p, q =
−ϕ(n) + n + 1 ±
p
(ϕ(n) − n − 1)2 − 4n
.
2
10.2. Diffie-Hellman key exchange. This cryptosystem, published
1976 by Whitfield Diffie and Martin Hellman and based on work of
Ralph Merkle’s to conceptualize public key cryptography, solves the
following problem: Is it possible for two persons to agree on a secret
key, known only to these two persons, via a public dialogue which can
be followed by whoever might be interested? Again the practical impact is immediate: for example encrypted data should be exchanged
between two systems which have to agree before the exchange over a
public channel on a secret key for en- and deciphering.
The DH key exchange protocol works as follows. Person A and B
agree on a prime p and an integer h not divisible by p. Then person A
chooses an integers a and B chooses an integer b, respectively, which
they do not communicate. But A sends to B the remainder hA of ha
after division by p, and B sends to A the remainder hB of hb after