Network Securitycsc445 Lec 9
Network Securitycsc445 Lec 9
Network Securitycsc445 Lec 9
Private-Key Cryptography
traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications are compromised also is symmetric, parties are equal hence does not protect sender from receiver forging a message & claiming is sent by sender
Public-Key Cryptography
probably most significant advance in the 3000 year history of cryptography uses two keys a public & a private key asymmetric since parties are not equal uses clever application of number theoretic concepts to function complements rather than replaces private key crypto
public invention due to Whitfield Diffie & Martin Hellman at Stanford Uni in 1976
known earlier in classified community
Public-Key Cryptography
public-key/two-key/asymmetric cryptography involves the use of two keys:
a public-key, which may be known by anybody, and can be used to encrypt messages, and verify signatures a private-key, known only to the recipient, used to decrypt messages, and sign (create) signatures
is asymmetric because
those who encrypt messages or verify signatures cannot decrypt messages or create signatures
Public-Key Cryptography
Public-Key Characteristics
Public-Key algorithms rely on two keys where:
it is computationally infeasible to find decryption key knowing only algorithm & encryption key it is computationally easy to en/decrypt messages when the relevant (en/decrypt) key is known either of the two related keys can be used for encryption, with the other used for decryption (for some algorithms)
Public-Key Cryptosystems
Public-Key Applications
can classify uses into 3 categories:
encryption/decryption (provide secrecy) digital signatures (provide authentication) key exchange (of session keys)
some algorithms are suitable for all uses, others are specific to one
RSA
by Rivest, Shamir & Adleman of MIT in 1977 best known & widely used public-key scheme based on exponentiation in a finite (Galois) field over integers modulo a prime
nb. exponentiation takes O((log n)3) operations (easy)
uses large integers (eg. 1024 bits) security due to cost of factoring large numbers
nb. factorization takes O(e log n log log n) operations (hard)
publish their public encryption key: PU={e,n} keep secret private decryption key: PR={d,n}
RSA Use
to encrypt a message M the sender:
obtains public key of recipient PU={e,n} computes: C = Me mod n, where 0M<n
note that the message M must be smaller than the modulus n (block if needed)
in RSA have:
n=p.q (n)=(p-1)(q-1) carefully chose e & d to be inverses mod (n) hence e.d=1+k.(n) for some k
decryption:
M = 1123 mod 187 = 88
Exponentiation
can use the Square and Multiply Algorithm a fast, efficient algorithm for exponentiation concept is based on repeatedly squaring base and multiplying in the ones that are needed to compute the result look at binary representation of exponent only takes O(log2 n) multiples for number n
eg. 75 = 74.71 = 3.7 = 10 mod 11 eg. 3129 = 3128.31 = 5.3 = 4 mod 11
Efficient Encryption
encryption uses exponentiation to power e hence if e small, this will be faster
often choose e=65537 (216-1) also see choices of e=3 or e=17
Efficient Decryption
decryption uses exponentiation to power d
this is likely large, insecure if not
can use the Chinese Remainder Theorem (CRT) to compute mod p & q separately. then combine to get desired answer
approx 4 times faster than doing directly
only owner of private key who knows values of p & q can use this technique
RSA Security
possible approaches to attacking RSA are:
brute force key search (infeasible given size of numbers) mathematical attacks (based on difficulty of computing (n), by factoring modulus n) timing attacks (on running of decryption) chosen ciphertext attacks (given properties of RSA)
Factoring Problem
mathematical approach takes 3 forms:
factor n=p.q, hence compute (n) and then d determine (n) directly and compute d find d directly
biggest improvement comes from improved algorithm currently assume 1024-2048 bit RSA is secure
ensure p, q of similar size and matching other constraints
Timing Attacks
developed by Paul Kocher in mid-1990s exploit timing variations in operations
eg. multiplying by small vs large number or IF's varying which instructions executed
infer operand size based on time taken RSA exploits time taken in exponentiation countermeasures
use constant exponentiation time add random delays blind values used in calculations
Summary
have considered:
principles of public-key cryptography RSA algorithm, implementation, security