19IT419 Aryan Bhatt

INFORMATION SECURITY
3IT02

ID :- 19IT419
NAME :- ARYAN BHATT
SUBJECT CODE :- 3IT02
SUBJECT NAME :- Information Security
19IT419 Aryan Bhatt

BIRLA VISHVAKARMA MAHAVIDYALAYA

ENGINEERING COLLEGE
(AN AUTONOMOUS INSTITUTION)
INFORMATION TECHNOLOGY DEPARTMENT
AY: 2021-2022, SEMESTER-1

Faculty Name: Prof. Dharmesh G.Patel

Subject: 03IT02: Information Security
Year: 3rd Year (5th SEM)
Practical List
No. Definition Page Number

01 To implement Caesar cipher encryption-decryption. 01

02 To implement Monoalphabetic cipher encryption-decryption. 03

03 To implement Playfair cipher encryption-decryption. 05

04 To implement Polyalphabetic cipher encryption-decryption. 09

05 To implement columnar transposition cipher encryption- 10

decryption.
06 To implement Rail-Fence cipher encryption-decryption. 12

07 17
To implement Hill- cipher encryption decryption.
08 -
To implement Diffie-hallman key exchange algorithm.
09 -
To implement RSA encryption-decryption.
10 -

To implement find primitive root of any prime number with

checking given number is prime number or not.
11 20
To implement Extended Euclidean Algorithm.
12 -
Case Study Advanced Cryptography Technique.

3IT02
19IT419 Aryan Bhatt

Practical 01

Aim: To implement Caesar Cipher encryption – decryption.

Code:
#include <iostream>
using namespace std;

char encryption(char s,int key)

{
if(s>64&&s<91)
return s=65+(s-65+key)%26;
else if(s>96&&s<123)
return s=97+(s-97+key)%26;
else
return s;
}

char decryption(char s,int key)

{
if(s>64&&s<91)
{
s=s-65;
if(s<key)
s=s+26;
return s=65+(s-key)%26;
}
else if(s>96&&s<123)
{
s=s-97;
if(s<=key)
s=s+26;
return s=97+(s-key)%26;
}
else
return s;
}

int main()
{
string s;
cout<<"Enter String : ";
cin>>s;

1 3IT02
19IT419 Aryan Bhatt

int key;
cout<<"Enter Key : ";
cin>>key;
for(int i=0;i<s.length();i++)
{
s[i]=encryption(s[i],key);
}
cout<<"Encryption : "<<s<<endl;
for(int i=0;i<s.length();i++)
{
s[i]=decryption(s[i],key);
}
cout<<"Decryption : "<<s<<endl;
return 0;
}

OUTPUT:

2 3IT02
19IT419 Aryan Bhatt

Practical 02

Aim: To implement Monoalphabetic Cipher encryption – decryption.

Code:

#include<bits/stdc++.h>
using namespace std;

char encryption(string check,char c)

{
return check[c-'a'];
}
bool checkFunc(string key,char c)
{
for(int i=0;i<key.size();i++)
if(key[i]==c)
return false;
return true;
}

int main()
{
string key,plainText;
char check[26];
cout<<"Enter Key : ";
cin>>key;
char temp='a';
int k=key.size();
for(int i=0;i<key.size();i++)
check[i]=key[i];
for(int i=0;i<26;i++)
{
if(checkFunc(key,temp))
{
check[k]=temp;
k++;
}
temp++;
}
cout<<"Check : ";
for(int i=0;i<26;i++)
cout<<check[i];
cout<<"\nEnter Plain text : ";
cin>>plainText;

3 3IT02
19IT419 Aryan Bhatt

for(int i=0;i<plainText.size();i++)
{
plainText[i]=encryption(check,plainText[i]);
}
cout<<"Encryption is : "<<plainText;
return 0;
}

OUTPUT:

4 3IT02
19IT419 Aryan Bhatt

Practical 03

Aim: To implement Playfair Cipher encryption – decryption.

Code:

#include<bits/stdc++.h>
using namespace std;

bool checkFunc(string key,char c)

{
for(int i=0;i<key.size();i++)
if(key[i]==c)
return false;
return true;
}

int main()
{
char a[5][5];
string keytemp;
char plainText[300]="",check[26]="",key[100]="";
int k=0,flag=-1;

cout<<"Enter Key : ";

cin>>keytemp;
if(keytemp[0]=='j')
flag=1;
key[k++]=keytemp[0];
for(int i=1;i<keytemp.length();i++)
{
char temp=keytemp[i];
if(keytemp[i]=='i'&&flag==1)
temp='j';
else if(flag==0&&keytemp[i]=='j')
temp='i';
if(temp=='i')
flag=0;
else if(temp=='j')
flag=1;
for(int j=0;j<k;j++)
{
if((key[j]==temp))
break;

5 3IT02
19IT419 Aryan Bhatt

if(j==k-1)
key[k++]=temp;
}
}

char temp='a';
for(int i=0;i<k;i++)
check[i]=key[i];
if(flag==-1)
flag=0;
for(int i=0;i<26;i++)
{
if(checkFunc(key,temp)&&((flag==0&&temp!='j')||(flag==1&&temp!='i')))
{
check[k]=temp;
k++;
}
temp++;
}

cout<<"Matrix is : "<<endl;
k=0;
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
a[i][j]=check[k++];
cout<<a[i][j]<<" ";
}
cout<<endl;
}
char plainTextTemp[300];
cout<<"Enter Plain text : ";
cin>>plainTextTemp;
for(int i=0;i<strlen(plainTextTemp);i++)
{
if(flag==0&&plainTextTemp[i]=='j')
plainText[i]='i';
else if(flag==1&&plainTextTemp[i]=='i')
plainText[i]='j';
else
plainText[i]=plainTextTemp[i];
}

char plain[(2*strlen(plainText))];

6 3IT02
19IT419 Aryan Bhatt

k=0;

for(int i=1;i<strlen(plainText);)
{
if(plainText[i-1]!=plainText[i])
{
plain[k++]=plainText[i-1];
plain[k++]=plainText[i];
i+=2;
}
else
{
plain[k++]=plainText[i-1];
if(plainText[i]!='q')
plain[k++]='x';
else
plain[k++]='q';
i++;
}
if(i==strlen(plainText))
{
plain[k++]=plainText[i-1];
if(plainText[i-1]!='q')
plain[k++]='x';
else
plain[k++]='q';
}
}

int r1=0,c1=0,r2=0,c2=0;
char ans[k];
for(int i=0;i<k;i+=2)
{
for(int j=0;j<5;j++)
{
for(int k=0;k<5;k++)
{
if(plain[i]==a[j][k])
{
r1=j;
c1=k;
}
if(plain[i+1]==a[j][k])
{
r2=j;
c2=k;

7 3IT02
19IT419 Aryan Bhatt

}
}
}
if(r1!=r2&&c1!=c2)
{
ans[i]=a[r1][c2];
ans[i+1]=a[r2][c1];
}
else if(r1==r2)
{
ans[i]=a[r1][((c1+1)%5)];
ans[i+1]=a[r2][((c2+1)%5)];
}
else
{
ans[i]=a[((r1+1)%5)][c1];
ans[i+1]=a[((r2+1)%5)][c2];
}
}
cout<<ans<<endl;
return 0;
}

OUTPUT:

8 3IT02
19IT419 Aryan Bhatt

Practical 04

Aim: To implement Hill Cipher encryption –

decryption.

Code:

#include<iostream>
using namespace std;

int main()
{
string plainText,key;

cout<<"Enter Plain Text : ";

cin>>plainText;

cout<<"Enter Key : ";

cin>>key;

for(int i=0;i<plainText.length();i++)
cout<<(char)((((plainText[i]-'a')+(key[i%key.length()]-'a'))%26)+'a');
return 0;
}

OUTPUT:

9 3IT02
19IT419 Aryan Bhatt

Practical 05

Aim: To implement columnar transposition cipher encryption-decryption.

Code:
#include<bits/stdc++.h>
using namespace std;

int main()
{
string plainText;
char key[1000],keytemp[1000];
cout<<"Enter Plain Text : ";
cin>>plainText;

cout<<"Enter Key : ";

cin>>key;

for(int i=0;i<strlen(key);i++)
keytemp[i]=key[i];

double n=(double)plainText.length()/strlen(key);
int k=ceil(n),temp=0;
char ans[k][strlen(key)];
sort(keytemp,keytemp+strlen(key));

for(int i=0;i<k;i++)
{
for(int j=0;j<strlen(key);j++)
{
if(temp<plainText.length())
ans[i][j]=plainText[temp++];
else
ans[i][j]='x';
}
}

for(int i=0;i<k;i++)
{
for(int j=0;j<strlen(key);j++)
{
cout<<ans[i][j]<<" ";
}
cout<<endl;

10 3IT02
19IT419 Aryan Bhatt

int a[strlen(key)];
for(int i=0;i<strlen(key);i++)
{
char t=key[i];
for(int j=0;j<strlen(key);j++)
{
if(t==keytemp[j])
{
a[j]=i;
keytemp[j]=NULL;
break;
}
}
}

cout<<"Ans = ";
for(int i=0;i<strlen(key);i++)
{
for(int j=0;j<k;j++)
{
cout<<ans[j][a[i]];
}
}
return 0;
}

OUTPUT:

11 3IT02
19IT419 Aryan Bhatt

Practical 06

Aim: To implement Rail-Fence cipher encryption-decryption.

Code:
#include<iostream>
#include<string.h>
using namespace std;

void decryption(char ans[],int key)

{

cout<<endl<<endl<<"Decoding using key and encode"<<endl<<endl;

char table[key][strlen(ans)];
int k=0,temp=key-1;

for(int i=0;i<key;i++)
for(int j=0;j<strlen(ans);j++)
table[i][j]='-';
for(int i=0;i<key;i++)
{
int j=i;
int flag=0;
while(j<strlen(ans))
{
table[i][j] = ans[k++];
if(i==0||i==(key-1))
{
j=j+((key-1)*2);
}
else if(i<(key/2))
{
if(flag==0)
{
j=j+(temp*2);
flag=1;
}
else
{
j=j+2;
flag=0;
}
}

12 3IT02
19IT419 Aryan Bhatt

else if(key%2!=0&&i==(key/2))
{
j=j+(temp*2);
}
else
{
if(flag==0)
{
j=j+2;
flag=1;
}
else
{
j=j+(i*2);
flag=0;
}
}
}
temp--;
}

cout<<"Table : "<<endl;
for(int i=0;i<key;i++)
{
for(int j=0;j<strlen(ans);j++)
{
cout<<table[i][j]<<"\t";
}
cout<<endl;
}

int flag=0,c=0;
char decode[strlen(ans)]="";
for(int j=0;j<strlen(ans);j++)
{
if(flag==1)
decode[j]=table[--c][j];
else
decode[j]=table[c++][j];

if(c==key)
{
flag=1;
c--;
}

13 3IT02
19IT419 Aryan Bhatt

else if(c==0)
{
flag=0;
c++;
}
}
k=0;

cout<<"Decode = "<<decode<<endl;

void encryption(char plainText[],int key)

{

cout<<endl<<"Encoding using plain Text and Key"<<endl;

int k=-1,c=0;

char table[key][strlen(plainText)],ans[strlen(plainText)]="";

for(int i=0;i<key;i++)
for(int j=0;j<strlen(plainText);j++)
table[i][j] = '-';

int flag=0;
for(int j=0;j<strlen(plainText);j++)
{

if(flag==1)
table[--c][j] = plainText[++k];
else
table[c++][j] = plainText[++k];

if(c==key)
{
flag=1;
c--;
}
else if(c==0)
{
flag=0;
c++;
}
}
k=0;

14 3IT02
19IT419 Aryan Bhatt

cout<<endl<<"Table : "<<endl;
for(int i=0;i<key;i++)
{
for(int j=0;j<strlen(plainText);j++)
{
cout<<table[i][j]<<"\t";
if(table[i][j]!='-')
ans[k++]=table[i][j];
}
cout<<endl;
}
cout<<endl;

cout<<"Encode = ";
for(int i=0;i<strlen(plainText);i++)
cout<<ans[i];

decryption(ans,key);
}

int main()
{
char plainText[100];
int key;

cout<<"Enter Plain Text : ";

cin>>plainText;
cout<<"Enter Depth : ";
cin>>key;

encryption(plainText,key);
}

15 3IT02
19IT419 Aryan Bhatt

OUTPUT:

16 3IT02
19IT419 Aryan Bhatt

Practical 07

Aim: To implement Hill- cipher encryption decryption.

Code:

#include<iostream>
#include<math.h>
using namespace std;

int main()
{
string key,plainText;
int n;
cout<<"Enter Key(4 or 9 letters) : ";
cin>>key;
n=(int)sqrt(key.length());
int a[n][n];
cout<<"Enter Plain Text : ";
cin>>plainText;
for(int i=0;i<key.length();i++)
{
int temp=0;
for(int j=0;j<n;j++)
{
for(int k=0;k<n;k++)
{
a[j][k]=key[temp++]-'a';
}
}
}
cout<<endl<<"Key Matrix : "<<endl;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cout<<a[i][j]<<"\t";
}
cout<<endl;
}
int rem;
rem=(plainText.length())%n;
for(int i=0;i<rem;i++)
{
plainText[i+plainText.length()]='x';

17 3IT02
19IT419 Aryan Bhatt

}
int temp=0,i=0;
int b[(plainText.length()+rem)/n][n][1];
for(int temp=0;temp<((plainText.length()+rem)/n);temp++)
{
for(int j=0;j<n;j++)
{
b[temp][j][0]=plainText[i++]-'a';
}
}

int ans[(plainText.length()+rem)/n][n][1];
cout<<endl<<"Ans = ";
for(int r=0;r<((plainText.length()+rem)/n);r++)
{
for(int i=0;i<n;i++)
{
ans[r][i][0]=0;
for(int k=0;k<n;k++)
{
ans[r][i][0]=ans[r][i][0]+(a[i][k]*b[r][k][0]);
}
ans[r][i][0]=ans[r][i][0]%26+'a';
}
}
for(int i=0;i<((plainText.length()+rem)/n);i++)
{
for(int j=0;j<n;j++)
{
cout<<(char)ans[i][j][0];
}
}
cout<<endl;

return 0;
}

18 3IT02
19IT419 Aryan Bhatt

OUTPUT:

19 3IT02
19IT419 Aryan Bhatt

Practical 11

Aim: To implement Extended Euclidean

Algorithm.

Code:
#include<iostream>
using namespace std;

int main()
{
int a,b;
cout<<"Enter Number A : ";
cin>>a;
cout<<"Enter Number B : ";
cin>>b;

int r1,r2,q=0,x1=1,x2=0,y1=0,y2=1;
r1 = a;
r2 = b;

int tempx,tempy,tempr;
cout<<"R"<<"\tQ"<<"\tX"<<"\tY"<<endl;
while(r2!=0)
{
cout<<r1<<"\t"<<q<<"\t"<<x1<<"\t"<<y1<<"\t"<<endl;
tempr = r1%r2;
q = r1/r2;
tempx = x1-(q*x2);
tempy = y1-(q*y2);
r1 = r2;
r2 = tempr;
x1 = x2;
x2 = tempx;
y1 = y2;
y2 = tempy;
}
cout<<r1<<"\t"<<q<<"\t"<<x1<<"\t"<<y1<<"\t"<<endl;
cout<<endl<<"Gcd is "<<r1<<endl;
return 0;
}

20 3IT02
19IT419 Aryan Bhatt

OUTPUT:

21 3IT02
 19IT419 Aryan Bhatt

Practical 8

Aim: To implement Diffie-Hallman key

exchange algorithm

Code:
#include<iostream>
#include<cmath>
using namespace std;
long long int power(long long int a, long long int b,long long int P)
{
if (b == 1)
return a;
else
}
return (((long long int)pow(a, b)) % P);

int main()
{
long long int P, G, x, a, y, b, ka, kb; P = 23;
cout<<"The value of P : "<< P <<endl;
G = 9;
cout<<"The value of G : "<< G <<endl;
a = 4;
cout<<"\nThe private key 'a' for ABC : "<< a <<endl;
x = power(G, a, P);
b = 3;
cout<<"The private key 'b' for XYZ : "<< b <<endl;
y = power(G, b, P);
ka = power(y, a, P);
kb = power(x, b, P);
cout<<"\nSecret key for the ABC : "<< ka <<endl;
cout<<"Secret Key for the XYZ : "<< kb <<endl;
return 0;

OUTPUT:

22 3IT02
 19IT419 Aryan Bhatt

Practical 9

Aim: To implement RSA encryption-decryption

Code:

#include<iostream>
#include<cmath> using
namespace std; int gcd(int
a, int h)
{
int temp;
while(1)
{
temp = a%h;
if(temp==0)
return h;
a = h;
h = temp;
}
}
int main()
{
double p,q,n,count,phi,e,d,k,msg,c,m; p = 3;
q = 7;
n=p*q;
phi = (p-1)*(q-1); e=2;
while(e<phi)
{
count = gcd(e,phi);
if(count==1)
break;
else
e++;
}
k = 2;
d = (1 + (k*phi))/e; msg
= 12;
c = pow(msg,e);
m = pow(c,d);

23 3IT02
 19IT419 Aryan Bhatt

c=fmod(c,n);
m=fmod(m,n);
cout<<"Message Data = "<<msg; cout<<"\nEncrypted
Data = "<<c; cout<<"\nOriginal Message Sent = "<<m;
return 0;
}

OUTPUT:

24 3IT02
 19IT419 Aryan Bhatt

Practical 10

Aim: To implement find primitive root of any prime

number with checking given number is prime number
or not.

Code:

#include<bits/stdc++.h> using
namespace std; bool
checkprime(int n)
{
if (n <= 1) return
false;
if (n <= 3) return
true;
if (n%2 == 0 || n%3 == 0) return
false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0) return
false;
return true;
}
int power(int x, unsigned int y, int p)
{
int res = 1; x
= x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p; y = y
>> 1;
x = (x*x) % p;
}
return res;
}
void primefact(unordered_set<int> &s, int n)
{
while (n%2 == 0)
{
s.insert(2); n
= n/2;

25 3IT02
19IT419 Aryan Bhatt

}
for (int i = 3; i <= sqrt(n); i = i+2)
{
while (n%i == 0)
{
s.insert(i); n
= n/i;
}
}
if (n > 2)
s.insert(n);
}
int findprim(int n)
{
unordered_set<int> s;
if (checkprime(n)==false) return -
1;
int phi = n-1;
primefact(s, phi);
for (int r=2; r<=phi; r++)
{
bool flag = false;
for (auto it = s.begin(); it != s.end(); it++)
{
if (power(r, phi/(*it), n) == 1)
{
flag = true;
break;
}
}
if (flag == false)
return r;
}
return -1;
}
int main()
{
int n = 761;

26 3IT02
19IT419 Aryan Bhatt

cout << "Smallest primitive root of " << n<< " = " << findprim(n); return 0;
}

OUTPUT:

27 3IT02