Cryptography

K.Divya JNTUH-126

AGENDA
History

Terms & Definitions

Symmetric and Asymmetric Algorithms

Hashing

Attacks on Cryptosystems
Cryptography 2

What is Cryptography
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, authentication, and nonrepudiation

The science of keeping data secure

Two transformation algorithms: Enciphering and Deciphering

Cryptography

Contd..
Hidden writing.

Used to protect information

Can ensure confidentiality Integrity and Authenticity too

Cryptography 4

History The Manual Era

Dates back to at least 2000 B.C. Pen and Paper Cryptography Examples Scytale Atbash Caesar Vigenere

Cryptography

History The Mechanical Era

Invention of cipher machines Examples Confederate Armys Cipher Disk Japanese Red and Purple Machines German Enigma

Cryptography

History The Modern Era

Computers! Examples Lucifer Rijndael RSA ElGamal

Cryptography

Jargon
Plaintext A message in its natural format readable by an attacker

Cipher text Message altered to be unreadable by anyone except the intended recipients

Key Sequence that controls the operation and behavior of the cryptographic algorithm

Key space Total number of possible values of keys in a crypto algorithm

Cryptography
8

Plain text

Cryptography

Cipher Text

Cryptography

10

Cryptography

Cryptography

11

Cryptographic Methods
Symmetric Same key for encryption and decryption Key distribution problem

Asymmetric Mathematically related key pairs for encryption and decryption Public and private keys

Cryptography

12

Symmetric Algorithms
DES Modes: ECB, CBC, CFB, OFB, CM

3DES

AES

IDEA

Blowfish
Cryptography
13

Asymmetric Algorithms
Diffie-Hellman RSA El Gamal Elliptic Curve Cryptography (ECC)

Cryptography

14

DES
This has been a US government standard for many years (although recently complimented with AES).

It uses a 64-bit key (actually, only 56 bits are used for the encryption, the other 8 bits are parity bits), so it is no longer viable.

Increased processing speeds (in recent years) are making brute force attacks on DES more viable

Cryptography

15

Rivest, Shamir, and Adelman (RSA)

RSA is the most famous public key algorithm. RSA starts with picking two HUMONGOUS prime numbers, p and q. Each of these prime numbers contains hundreds to thousands of bits. The two prime numbers remain secret (they are the private key). Their product, n = p * q, is the public key. Security of RSA relies on two assumptions Factoring is required to break the system Factorization cannot be done in polynomial-time
Cryptography 16