# 35 - Introduction Public Key Cryptography Discrete...

This preview shows pages 1–7. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Introduction Public Key Cryptography Discrete Mathematics Andrei Bulatov Discrete Mathematics – Public Key Cryptography 35-2 Previous Lecture Linear congruences Chinese Remainder Theorem Discrete Mathematics – Public Key Cryptography 35-3 Fermat’s Theorem Fermat’s Great (Last) Theorem . For any n > 2, the equation does not have integer solutions x,y,z > 0 It had remained unproven for 358 years (posed in 1637, proved in 1995) Andrew Wiles proved it in 1995 n n n z y x = + Discrete Mathematics – Public Key Cryptography 35-4 Fermat’s Little Theorem Fermat’s Little Theorem. If p is prime and a is an integer not divisible by p, then Clearly, it suffices to consider only residues modulo p. p) (mod 1 a 1 p ≡- 5 Z ⋅ 1 2 3 4 1 2 3 4 1 2 3 4 2 4 1 3 3 1 4 2 4 3 2 1 Discrete Mathematics – Public Key Cryptography 35-5 Fermat’s Little Theorem (cntd) Fermat’s Little Theorem was improved by Euler Fermat’s Little Theorem improved For any integers m and a such that they are relatively prime where φ (m) denotes the Euler totient function, the number of numbers 0 < k < m relatively prime with m Example: m) (mod 1 a (m) ≡ ϕ 8 Z Discrete Mathematics – Public Key Cryptography 35-6...
View Full Document

{[ snackBarMessage ]}

### Page1 / 12

35 - Introduction Public Key Cryptography Discrete...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online