Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Prime Numbers
A prime number is divisible only by 1 and
itself For example: {2, 3, 5, 7, 11, 13, 17, } 1 could also be considered prime, but its not very useful.
Prime Factorization
To factor a number n is to write it as a
product of other numbers. n=a*b*c Or, 100 = 5 * 5 * 2 * 2 Prime factorization of a number n is writing it as a product of prime numbers. 143 = 11 * 13
common divisors other than 1. 10 and 21 are relatively prime, in respect to each other, as 10 has factors of 1, 2, 5, 10 and 21 has factors of 1, 3, 7, 21. The Greatest Common Divisor (GCD) of two relatively prime numbers can be determined by comparing their prime factorizations and selecting the least powers.
will be 1. Consider the following: 10(1, 2, 5, 10) and 21(1, 3, 7, 21) GCD(10, 21) = 1 It then follows, that a prime number is also relatively prime to any other number other than itself and 1.
profession and an amateur mathematician. Fermat rarely published his mathematical discoveries. It was mostly through his correspondence with other mathematicians that his work is known at all. Fermat was one the inventors of analytic geometry and came up with some of the fundamental ideas of calculus. He is probably most famous for a problem that went unsolved until 1994; that the equation xn + yn = zn has no non-trivial solution when n>2.
History Cont.
One of Fermats books contained a
handwritten note in the margin declaring that he had a proof for this equation, but it would not fit in the margin. He never published his proof, nor was it found after his death. In 1994 Andrew Wiles worked out a proof of this equation using advanced modern techniques.
p, then . . . ap-1 1 (mod p). And for every integer a ap a (mod p). This theorem is useful in public key (RSA) and primality testing.
be n-1 whenever n is a prime number. This implies that (n) will be easy to calculate when n has exactly two different prime factors: (P * Q) = (P-1)*(Q-1), if P and Q are prime.
an important key to the RSA algorithm. If GCD(a, p) = 1, and a < p, then ( p) a 1(mod p). In other words, If a and p are relatively prime, with a being the smaller integer, then when we multiply a with itself (p) times and divide the result by p, the remainder will be 1.
If a = 5 and p = 6 Then (6) = (2-1) * (3-1) = 2 So, 5 (6) = 25 and 25 = 24+1 = 6*4+1
=> 25 = 1(mod 6) OR 25 % 6 = 1 It also follows that a (p)+1 a(mod p) so that
Okaaaay . . . So What?
Eulers theorem uses modulus arithmetic
which helps to lay the foundation for RSA encryption. To construct a personal cipher key we need an appropriate value we will call variable R. So, we select two very large prime numbers U and V and multiply them. => (R) = (U-1)*(V-1). This makes R difficult to factor, since the fewer factors a number has, the longer it takes to find them.
So What? Cont.
We also define the variables P and Q. P is an arbitrary
number that is relatively prime to (R). Q is the calculated inverse of P in (mod (R)). We use P and R to create a public key, and Q and R to create a private key. This yields P*Q 1(mod (R) ). The result is that too much information is lost in the encryption due to the modulus arithmetic to decipher a privately encrypted RSA message without the use of the public key. Unless the would-be decipherer had enough time and processing power to attempt a brute-force factorization. But, the larger the primes, the longer it takes to factor their product.
Information in these slides compiled by Christopher Simons