CC3.12 Erdal KOSE

1. CC3.12 Erdal KOSE Privacy & Digital Security Encryption

2. Objectives • Cryptography • Conventional ( Symmetric or Single Key) Encryption: • Public-Key Encryption (Asymmetric Encryption) • Sample Public-Key Systems: • The relationship between the two keys • PGP • Encoding Method: • Decoding Method: • Advantages: • PGP Method • Digital Signature

3. Cryptography • Cryptography: The study of methods to encrypt data to insure the privacy of transmitted messages • Cryptanalysis: The study of methods to decode encrypted data. • Clear Text or Plaintext: the information before encryption • Cipher Text: the encrypted form of data • One-way cipher: an encrypted technique that cannot be easily reversed

4. Cont.. • Information is encrypted so it can be safely transmitted or stored. Transmitting or storing unencrypted information is not secure. • The clear-text will be recovered by reversing the encryption process. Recovering clear text from encrypted text (cipher) is called decrypting the cipher text.

5. Conventional = Symmetric= Single Key Encryption: • Conventional (Symmetric or Single Key) Encryption: A simple algorithm is used to transform the data • The sender and receiver agree on a key Ksr. The sender uses the key to encrypt the clear-text, and the receiver uses it to decrypt the cipher text

6. Ksr Ksr Cipher text Esr(T)=C Sender Encrypts T with Ksr Receiver Decrypts C with Krs Dsr(C)=Clear-Text T Clear-Text T Point where information is transmitted or stored: could be snooped here

7. An Example XOR An Encryption Operation: Exclusive OR, known as XOR is a way to apply a key to cleartext, XOR can be decribed as x or y but not both. if the bits are same the result is “0” otherwise the result is “1”. If 0101 is the cleartext and if 1001 is the key then 0 1 0 1 Cleartext 1 0 0 1 Key ________ 1 1 0 0 cipher text. To produces 1100 (cleartext) for the cipher text. Apply the key to the cipher text again with XOR produces the original cleartext. 1 1 0 0 Cipher text 1 0 0 1 Key ________ 0 1 0 1 cleartext How secure is this method? How do you transfer the key to the receiver?

8. More example Substitution Cipher: Each data element is substituted with a different data element (or symbol). Example: Caesar’s Method: Replace every letter in the alphabet with the letter 3 away from it: A –> D B –> E C –> F ... X –> A Y –> B Z –> C Other substitution ciphers assign random substitutions, so that they are a bit harder to crack. How does the receiver decode the message? Answer: The sender needs to send the key to the receiver.

9. Sample Public-Key Systems (Asymmetric Encryption) • Uses 2 keys - a public key and a private key. • The receiver publishes its public key which is used by the sender to encrypt the message. • The receiver uses the second (and different) private key to decrypt the message.

10. Cont.. • What is the relationship between the two keys? • It should be computationally infeasible to obtain the private key from a knowledge of the public key and the transmitted message. • These methods are based on the fact that it is computationally easy to multiply two large numbers, but it is quite difficult to factor a large number if it has very • few factors, especially, if the factors are large prime • numbers. (e.g., Try to factor 3233.)

11. Cont.. • Advantage of Public-Key Systems: • Only the public key is distributed. • Sample Public-Key Systems: • RSA - Rivest, Shamir, and Adelman • DSA - Digital Signature Algorithm • PGP - Pretty Good Privacy - uses both conventional and public-key cryptography.

12. PGP • Encoding Method: 1. Compress the message 2. Create a session key that is used only during this session. The key is created randomly from mouse movements and key strokes. 3. The session key is used to conventionally encrypt the message. 4. The receiver’s public key is used to encrypt the session key. 5. The encrypted message and the encrypted session key are transmitted to the receiver.

13. Cont.. • Decoding Method: 1. The receiver uses its private key to decrypt the session key. 2. The session key is used to decrypt the message. 3. The data is decompressed. 4. The session key is discarded.

14. Advantages: • - Only a small amount of information (the session • key) is publically encrypted. • - The session key is used only once. • - Conventional encryption can be ~10,000 faster • than public-key encryption.

15. PGP Method • PGP uses the RSA public-key method: • M = the message • C = the encrypted message • e = the public exponent (public-key) • d = the private exponent (private key) • n = a very large integer

16. Cont.. • Encryption Method: • C = M*e mod n • Decryption Method: • M = C*d mod n • where • n = p * q • p and q are large prime numbers • d = e-1 mod ((p-1) * (q-1)) • ! If n is a large number (128 bits or 256 bits), it is • computationally infeasible to find p and q. • - must find all factors of n. • - must determine which are prime. • - must try all pairs of primes to find p and q.

17. Digital Signature • Used to verify that the “sender” actually sent the message. • The receiver publishes its public key which is used by the sender to encrypt the message. • The sender then uses its private key to encode the encrypted message. (This is a second level of encryption.) • The receiver first uses the sender’s public key to decrypt the message. • The receiver then uses the receiver’s private key to fully decrypt the message.