Scribd
Upload
228 views27 pages

Unit - III Cns

This document discusses the mathematical foundations of public key cryptography. It covers topics such as prime numbers, prime factorization, relatively prime numbers, the greatest common divisor, Fermat's Little Theorem, Euler's totient function, and Euler's Theorem. It also discusses discrete logarithms and how they relate to exponentiation in forming the basis of asymmetric key ciphers like RSA.

Uploaded by

Kavi Priya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
228 views27 pages

Unit - III Cns

This document discusses the mathematical foundations of public key cryptography. It covers topics such as prime numbers, prime factorization, relatively prime numbers, the greatest common divisor, Fermat's Little Theorem, Euler's totient function, and Euler's Theorem. It also discusses discrete logarithms and how they relate to exponentiation in forming the basis of asymmetric key ciphers like RSA.

Uploaded by

Kavi Priya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 27

unit -III

UNIT III PUBLIC KEY CRYPTOGRAPHY


MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes –
Primality Testing –Factorization – Euler‘s totient function, Fermat‘s
and Euler‘s Theorem – Chinese Remainder Theorem –
Exponentiation and logarithm – ASYMMETRIC KEY CIPHERS: RSA
cryptosystem – Key distribution – Key management – Diffie Hellman
key exchange -ElGamal cryptosystem – Elliptic curve arithmetic-
Elliptic curve cryptography.
Prime Numbers
• prime numbers only have divisors of 1 and self
– they cannot be written as a product of other numbers
– note: 1 is prime, but is generally not of interest
• eg. 2,3,5,7 are prime, 4,6,8,9,10 are not
• prime numbers are central to number theory
• list of prime number less than 200 is:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83
89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173
179 181 191 193 197 199
Prime Factorisation
• to factor a number n is to write it as a product of other
numbers: n=a × b × c
• note that factoring a number is relatively hard compared to
multiplying the factors together to generate the number
• the prime factorisation of a number n is when its written
as a product of primes
– eg. 91=7×13 ; 3600=24×32×52
– It is unique
Relatively Prime Numbers & GCD
• two numbers a, b are relatively prime if have no
common divisors apart from 1
– eg. 8 & 15 are relatively prime since factors of 8 are 1,2,4,8 and
of 15 are 1,3,5,15 and 1 is the only common factor
• conversely can determine the greatest common divisor by
comparing their prime factorizations and using least
powers
– eg. 300=21×31×52 18=21×32 hence
GCD(18,300)=21×31×50=6
Fermat's Little Theorem

• ap-1 mod p = 1
where p is prime and a is a positive integer not divisible by p
Euler Totient Function ø(n)
• when doing arithmetic modulo n
• complete set of residues is: 0..n-1
• reduced set of residues includes those numbers which are
relatively prime to n
– eg for n=10,
– complete set of residues is {0,1,2,3,4,5,6,7,8,9}
– reduced set of residues is {1,3,7,9}
• Euler Totient Function ø(n):
– number of elements in reduced set of residues of n
– ø(10) = 4
Euler Totient Function ø(n)
• to compute ø(n) need to count number of elements to be
excluded
• in general need prime factorization, but
– for p (p prime) ø(p) = p-1
– for p.q (p,q prime) ø(p.q) = (p-1)(q-1)
• eg.
– ø(37) = 36
– ø(21) = (3–1)×(7–1) = 2×6 = 12
Euler's Theorem
• a generalisation of Fermat's Theorem
• aø(n)mod n = 1
– where gcd(a,n)=1
• eg.
– a=3;n=10; ø(10)=4;
– hence 34 = 81 = 1 mod 10
– a=2;n=11; ø(11)=10;
– hence 210 = 1024 = 1 mod 11
Discrete Logarithms or Indices
• the inverse problem to exponentiation is to find the discrete
logarithm of a number modulo p
• Given a, b, p, find x where ax = b mod p
• written as x=loga b mod p or x=inda,p(b)
• Logirthm may not always exist
– x = log3 4 mod 13 (x st 3x = 4 mod 13) has no answer
– x = log2 3 mod 13 = 4 by trying successive powers
• whilst exponentiation is relatively easy, finding discrete logarithms
is generally a hard problem
– Oneway-ness: desirable in modern cryptography

You might also like