ELEC5616_Computer And Network Security_2014 Semester 1_CNS_Lecture_2.pdfVIP

COMPUTER NETWORK SECURITY Lecture 2: Hash Functions APPLIED CRYPTOGRAPHY Cryptography is the study of mathematical techniques related to the design of cyphers Cryptanalysis is the study of breaking them Cryptology (or crypto) is the study of both Crypto building blocks are otherwise known as cryptographic primitives e.g. hash functions, block cyphers, stream cyphers, digital signatures WEAK VS STRONG CRYPTOGRAPHY There are two types of crypto in the world: Crypto that stops your kid sister from reading your e-mail Crypto that stops major governments from reading your e-mail and tracking your activities We are concerned with the latter. FUNCTIONS fncon f : is dened y Two sets X (domain) and Y (codomain) A rule f If x є then The image of x is the element in Y which rule f associates with x The image y of x is denoted by y = f(x) If y є then A preimage of y is an element x є X for which f(x) = y The set of elements in which have at least one preimage is called the image of f, or Im(f) ONE WAY FUNCTIONS fnction f: f(x) = {0,1}n {0,1}m is one way (OWF) if: It is “easy” to compute f(x) for all x є X It is “computationally infeasible” to find any x є X given “essentially all” elements y є Im(f) That is, given a random y є Im(f), it is computationally infeasible to find any x є X such that f(x) = y Intitively: Given x it is easy to compute f(x) Given f(x) it is hard to compute x ONE WAY FUNCTION EXAMPLES Example: Write a message m on the side of a plate Drop the plate [ f(m) ] Finding the inverse is difficult (but not impossible) f(m) = E(m, k) Where E is the Data Encryption Standard (DES) cypher Given message m and DES(m, k) it is hard to find key k f(m) = RS(m, e, n) = me mod n Represent message m as a number e (encryption key) is public n = pq is public where p and q are both large primes (but p q are secret) e.g. f(m) = m3 mod (48611 · 53993) This will make more se