Basic Security Issues Mechanism Services Attack 3 Aspect of Information Security Security Mechanism Security Services Security Attack

Ceaser Cipher
Cease Cipher Manipulate the Character with 3 positions (for example: if we Cipher A into Ceaser technique then it should be D) Formula C= E(P) C= (P+3) mod26 C= (P+K) mod26 C= Answer Where C= Cipher P= Plain Text E= Encryption K= Key Example P = 81529 0123456789 1 2 3 4 5 6 7 8 9 10 C=E(P) C = (P+K) mod10 C = (P+3)mod10 C = (8+3)mod10 = 1 C = (1+3)mod10 = 4 C = (5+3)mod10 = 8 C = (2+3)mod10 = 5 C = (9+3)mod10 = 2 E = 14852 P= MUSTARD ABCDEFGHIJKLMNOP QRSTUVWXYZ E= PXVWDUG

Transportation Technique
In Transportation technique we assign fixed range of column, and in that column all the text is entered and encrypt the text with respect to the column of the row Example We are taking 10 Column for the text P= COMPUTER GRAPHIC MAY BE SLOW BUT ITS EXPENSIVE 1 C A S E 2 O P L X 3 M H O P 4 P I W E 5 U C B N 6 T M U S 7 E A T I 8 R Y I V 9 G B T E 10 R E S Z

E= CAESE OPS MHLE PIOX UCWP T BE EMUN RATS GYII RBTV

Time required at 1 Encryption/ U sec 2^31 U sec = 35.8 min Key size 32 56 128 168 Number of Alternative Keys 2^31 = 4.3 x 10^9 2^55 = 7.2 x 10^16 2^127 = 3.4 x 10^38 2^167 = 3.7 x 10^50 Time required for 1 encryption 2^31usec=35.8 2^55usec=10 hours 2^127usec= 2^167usec= Time required at 10^6 Decryption 2.15 millisecond 10 hours 5.4x10^18 years 5.9x 10^30 years

Where Time Required for 1 encryption for 56 Key size formulated as 2^55 ________________ 3600 x 10^6 x 10^6 and Time Required for 1 Encryption for 168 keys are formulated as 2^167 _______ _____________ 3600 x 10^6 x 10^6 x 365 x 24

Play Fair Cipher

In play fair cipher technique we draw a 5 x 5 matrix and in that matrix the word in encrypted, IN THE REMAINING COLUMN we add the remaining alphabets Example Keyword: Monarchy M C
E L U

O H
F P V

N Y
G Q W

A
B I/J S X

R
D K T Z

ABCDEFGHIJKLMNOPQRSTUVWXYZ
AR = (A Converted to the next one that is R and R Converted to the next one that is M) AR = RM MU = (Now Mu belongs to the same column, so M will be converted to the next one that is C and U will be converted into the next one that is M) MU = CM HS = ( H and S belongs to two different column, now we first draw line to H row as the Line Intercepts the B so H will be converted into B and for S we again draw a line as we drew for H, As blue line Intercepts on P so ) HS = BP Substitution Technique

DES Algorithm Des algorithm work on behf of Hexa Decimal Nubers Plain text= 675a69675e5a6b5a 1st step Convert the above number into binary 1234 5678 9-12 13-16 17-20 21-24 25-28 29-32 33-36 37-40 41-44 45-48 49-52 53-56 57-60 61-64

0110 | 0111 | 0101 | 1010 | 0110 | 1001 | 0110 | 0111 | 0101 | 1110 | 0101 | 1010 | 0110 | 1011| 0101 | 1010 2nd Step (IP Initial Permutation) We will consider Table 58 50 60 52 62 54 64 56 57 49 59 51 61 53 63 65 1 1 0 0 0 0 1 1 1 0 0 1 0 1 1 1 42 44 46 48 41 43 45 47 1 1 0 0 0 0 1 1 34 36 38 40 33 35 37 39 1 1 1 0 0 0 1 1 26 28 30 32 25 27 29 31 1 0 1 1 0 1 0 1 18 20 22 24 17 19 21 23 1 0 0 1 0 1 1 0 10 12 14 16 9 11 13 15 1 1 0 0 0 0 1 1 2 4 6 8 1 3 5 7 1 0 1 1 0 1 0 1

3rd Step 3rd step is to convert the above binary numbers into Hexa decimal Note: convert only 4 Block of Number 1111=F+1111=F Converted Hexa String = FF B2 19 4D 00 4D F6 FB 4th Step Taking the inverse permutation 1 1 0 0 0 0 1 1 Here Inverse these strings 1111 1111 1011 0010 0001 1001 0100 1101 0000 0000 0100 1101 1111 0110 1111 1011 1 0 0 1 0 1 1 1 1 1 0 0 0 0 1 1 1 1 1 0 0 0 1 1 1 0 1 1 0 1 0 1 1 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 1 0 1 1 0 1 0 1