Crypto Review

Review Topics
Goals of Crypt algorithms. Hash algorithms Symmetric key encryption Asymmetric key encryption Diffie-Hellman crypto algorithm

 The goals of crypto algorithms:

Confidentiality Integrity Authentication Non-repudiation Sharing a secret key

Hashing

Hash (Message Digest)

Hash (message digest)
- Message Integrity Code
- Non keyed (message alone) - Integrity

- Message Authentication Code (MAC)

- Keyed message digest (message + secret key) - Integrity + Authentication

Keyed Message Digest Assurance

 Symmetric Key Encryption

Shared Secret Key Shared Secret Key

CLEAR TEXT

ENCRYPTED MESSAGE

CLEAR TEXT

Sender sends clear text

Clear text is encrypted with the shared secret key.

Encrypted message is sent to the receiver.

Encrypted message is decrypted with the shared secret key by the receiver.

Encrypted text is now decrypted and readable to the receiver.

Diagram 1 Symmetric Key Encryption

Symmetric key encription

Achieves Confidentiality Symmetric key encryption algorithms
DES (Triple DES) AES (Advanced Encryption Standard)

Asymmetric Key Encryption

Recipients Public Key Recipients Private Key

Clear Text

Encrypted Text

Clear Text

The sender uses the recipients public key to encrypt the clear text message.

The encrypted message is sent to the recipient.

The message is decrypted by the recipients private key.

The decrypted message is readable by the recipients.

Diagram 2 Asymmetric Encryption

Asymmetric Key Encryption (RSA)

Assume Alice & Bob have their own private key/public key pair. Assuming that Alice is the only one who has the copy of her private key (she keeps her private key in a safe place), she can
Prove who she is (signs a document with her private key). Prove that her message was not altered in transit. send Bob messages that she cannot later deny sending.

With Alices public key, Bob can

Send Alice confidential information. Verify Alices identity. Validate signed messages made by Alice.

Diffie-Hellman Key Exchange Protocol

The Diffie-Hellman Problem and the Discrete Logarithm Problem

Diffie-Hellman Problem

Discrete Logarithm Problem Both Problems are known to be intractable (difficulties of these problems depend on the size of the problem, e.g., size of g and private data a, b Alice and bob choose; as the size of the problem increases, the complexity exponentially grows).