Cryptography Derives from the Greek words

kruptos meaning secret and graphia meaning writing. Secret Writing Steganography (Hidden) Code Secret (Replace words) Writing Substitution Cryptography Cipher (Scrambled) (Replace letters) Transposition

 Authentication: The process of proving one's

identity.
Privacy/confidentiality: Ensuring that no one can

read the message except the intended receiver.

Integrity: Assuring the receiver that the received

message has not been altered in any way from the original.
Non-repudiation: A mechanism to prove that the

sender really sent this message.

 Secret Key Cryptography (SKC): Uses a single key for

both encryption and decryption

Public Key Cryptography (PKC): Uses one key for

encryption and another for decryption

Hash Functions: Uses a mathematical

transformation to irreversibly "encrypt" information

 Sender applies encryption function of original

plaintext message resulting in a cipher text message that is sent over the network.
Two kinds of cryptosystem: Symmetric: Same key used to encrypt &

decrypt(secret key) Asymmetric: Different key used to encrypt & decrypt(private key)

Message in plain text

Message in plain text

Encrypt

Decrypt

Message in plain text

Message in plain text

Insecure Network

 The Data Encryption Standard (DES) specifies a FIPS approved

cryptographic algorithm as required by FIPS 140-1.

This publication provides a complete description of a mathematical

algorithm for encrypting (enciphering) and decrypting (deciphering) binary coded information.

Encrypting data converts it to an unintelligible form called cipher.

Decrypting cipher converts the data back to its original form called plaintext. The algorithm described in this standard specifies both enciphering and deciphering operations which are based on a binary number called a key.

 The sending computer encrypts the document with a

symmetric key, then encrypts the symmetric key with the public key of the receiving computer. The receiving computer uses its private key to decode the symmetric key. It then uses the symmetric key to decode the document.

 First Pass: The new value of digest is produced from

old value & 16 message words.

This process continues until all 16 words have been

digested.
F(a, b, c) is a combination of bitwise operator

(OR, AND, NOT).

 Second Pass: F is replaced by function G.

The amount of left rotation is {5,9,14,20,5,9} at each

step. Third Pass: G is replaced by function H. The amount of left rotation is {4,11,16,23,4,11} at each step. Fourth Pass: H is replaced by I. The amount of left rotation is {6,10,16,21,6,10} at each step.