By: Kirti Chawla

Introduction

What is a Cipher or Crypto-algorithm ? A method or system for transforming given information in order to conceal its meaning.

Classification
Algorithms Vis--Vis Looking back

Prologue Introduction

Transposition ciphers

Classification
Algorithms Vis--Vis Looking back
Substitution ciphers
Computers Can Only Execute Answers

Transposition

CCOEAoan xnmnlesp _ycwu__u et__tre_ _ess____

Computers Can Only Execute Answers

Substitution

Frpsxwhuv Fdq Rqob Hahfxwh Dqvzhuv

Algorithms Genealogy Introduction Algorithms

Classification
Algorithms Vis--Vis Looking back Symmetric Asymmetric

Ciphers

Authenticators

DES\3DES AES IDEA RC6 BlowFish

RSA ELGAMAL

SHA MD5

Algorithmic Parlance Introduction

Classification
Algorithms Vis--Vis Looking back
Strong Open Key-oriented

At the heart of Algorithms

Categories
Deciding Operations
1. 2. 3.

Methods to do
Simple XOR Modular Arithmetic with Polynomials Relative Prime Factors

Classification
Algorithms Vis--Vis Looking back
Key Management Controlled Chaos Creation

1. 2. 3.

S-boxes & P-boxes Inversion Data distribution/redundancy

1. 2. 3.

Self generation or ask from user Key organization Key protection

Anomalous Behavior Handling

1. 2. 3.

Buffer management Padding and boundary cases State management

Directional Behavior

1. 2.

Hash or One time PADs Bi-directionality

Deciding Operations
Introduction
Simple XOR
This is secret message This is key Axaw sa dawawt sazawcsr

Classification
Algorithms Vis--Vis Looking back

Modular arithmetic with polynomials

This is secret message

X7 + x5 + x2 + 1

This is key

Axaw sa dawawt sazawcsr

Relative prime factors

This is secret message

Axaw sa dawawt sazawcsr

Controlled Chaos Creation

Classification
Algorithms Vis--Vis Looking back

Inversion

Data distribution/redundancy

1010 (data)
001 1010 001 1010 0101(data) 1010 001 1010 001

Key Management
Introduction
Self-generation 1010 (data) 1010 XOR 11 = 1001 Ask from user

Classification
Algorithms Vis--Vis Looking back

0101 (data) 0101 XOR 11 = 0110

Key organization

Key protection

1010 0000 1010 1111 0000 1011 (key) 1010 0000 1010 (key)

1010 0000 1010 1111 0000 1011 (key) 1010 0000 1010 1111 0000 1010 1010

Anomalous Behavior Handling Introduction

Classification
Algorithms Vis--Vis Looking back

1010 1000 0010 1100 [+] 1000 1001 = Overflow Capture of 1010 1000 0010 1100 as plain-text from buffer on which algorithm operate

If the input data or key are not exactly fulfilling the algorithm requirements, lets say required input is of multiple of 2 and > 512 bit, but user does not provide !

Boundary cases

State management

U/SIGN-INT * U/SIGN-INT > 65536/32768

If the algorithm works in various stages, each stage signifying a state and regurgitating partially (weak) cipher-text and hence making possible interleaving !

Directional Behavior Introduction

Hash or one time PADs

Classification
Algorithms Vis--Vis Looking back

Use one character once only for substitution. Destroy or delete encryption mechanism. Destroy or delete decryption mechanism. Hash differs from one time PADs in a way of producing output. Bi-directionality

Given the single algorithm, the enciphering and deciphering operations should be inverse of each other. Bi-directional nature of algorithm is there, because of need to get original data back.

Symmetric Ciphers Introduction

A single key for enciphering and deciphering operations. More the number of bits of key, more secure your data. Algorithms are usually characterized as stream or block ciphers. Algorithmic proclivity to certain weak keys can create problem.

Classification
Algorithms Vis--Vis Looking back

Used generally for protecting data.

Asymmetric Ciphers Introduction

Classification
Algorithms Vis--Vis Looking back

One key for enciphering and another key for deciphering operation.

More the distance between mutually prime nos. (here they are key), more secure your data.
Used generally for protecting data as well for making sure its authentication.

Authenticators Introduction Hash functions gives a fixed-length output for a arbitrary-length message. Strength of algorithm is measured by collision resistance. Uni-directionality is innate capability of authentication algorithms. Authentication is achieved by re-computing hash and compared with stored hash value.

Classification
Algorithms Vis--Vis Looking back

 Introduction

DES/ algorithms

Classification
Algorithms Vis--Vis Looking back
Caesar cipher
Cipher cylinders

Enigma

Egyptian pictorial substitution