* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
Download Elementary Number Theory
Mathematical proof wikipedia , lookup
Mathematics of radio engineering wikipedia , lookup
Georg Cantor's first set theory article wikipedia , lookup
Vincent's theorem 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
Wiles's proof of Fermat's Last Theorem wikipedia , lookup
Number theory wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
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