Ex.

Date Name of the Experiment Page Mark Signature

No. no
1. Perform encryption, decryption using the
following substitution techniques

i. Ceaser cipher
ii. Playfair cipher
iii. Hill Cipher
iv. Vigenere cipher

2 Perform encryption and decryption using

following transposition techniques

i. Rail fence
ii. Row & Column Transformation

3 Apply DES algorithm for practical

applications.
4 Apply AES algorithm for practical
applications.
5 Implement RSA Algorithm using HTML and
JavaScript

6 Implement the Diffie-Hellman Key Exchange

algorithm for a given problem.
7 Calculate the message digest of a text using
the SHA-1 algorithm.
8 Implement the SIGNATURE SCHEME -
Digital Signature Standard.

9 Demonstrate intrusion detection system

(ids) using any tool eg. Short or any
other s/w.

10 Automated Attack and Penetration Tools

Exploring N-Stalker, a
Vulnerability Assessment Tool

11
12 Defeating Malware

i. Building Trojans
ii. Rootkit Hunter
Ex. No : 1(a) Encryption and Decryption Using Ceaser Cipher
Date :

AIM:
To encrypt and decrypt the given message by using Ceaser Cipher
encryption algorithm.

ALGORITHMS:

1. In Ceaser Cipher each letter in the plaintext is replaced by a letter some

fixed number of positions down the alphabet.

2.For example, with a left shift of 3, D would be replaced by A, E would

become B, and so on.

3.The encryption can also be represented using modular arithmetic by first

transforming the letters into numbers, according to the scheme, A = 0, B = 1,
Z = 25.

4. Encryption of a letter x by a shift n can be described mathematically as,

En(x) = (x + n) mod26

5. Decryption is performed similarly,

Dn (x)=(x - n) mod26

PROGRAM:
CaesarCipher.java

import java.util.*;
class caesarCipher {
public static String encode(String enc, int offset) {
offset = offset % 26 + 26;
StringBuilder encoded = new StringBuilder();
for (char i : enc.toCharArray()) {
if (Character.isLetter(i)) {
if (Character.isUpperCase(i)) {
encoded.append((char) ('A' + (i - 'A' + offset) % 26));
} else {
encoded.append((char) ('a' + (i - 'a' + offset) % 26));
}
} else {
encoded.append(i);
}
} return encoded.toString();
}
public static String decode(String enc, int offset) {
return encode(enc, 26 - offset);
}
public static void main(String[] args) throws java.lang.Exception {
Scanner x=new Scanner(System.in);
System.out.println(“Enter the Plain Text:”);
String msg =x.nextLine();
System.out.println("Simulating Caesar Cipher\n------------------------");
System.out.println("Input : " + msg);
System.out.printf("Encrypted Message : ");
System.out.println(caesarCipher.encode(msg, 3));
System.out.printf("Decrypted Message : ");
System.out.println(caesarCipher.decode(caesarCipher.encode(msg, 3), 3));
}
}

OUTPUT:

Simulating Caesar Cipher

------------------------
Enter the Plain Text:Anna University
Encrypted Message : Dqqd Xqlyhuvlwb
Decrypted Message : Anna University

RESULT:
Thus the program for ceaser cipher encryption and decryption algorithm has
been implemented and the output verified successfully.
Ex.No :1(a) Playfair Cipher
Date :

AIM:
To implement a program to encrypt a plain text and decrypt a cipher text
using play fair Cipher substitution technique.
ALGORITHM:
1. To encrypt a message, one would break the message into digrams (groups of
2 letters)
2. For example, "HelloWorld" becomes "HE LL OW OR LD".
3. These digrams will be substituted using the key table.
4. Since encryption requires pairs of letters, messages with an odd number of
characters usually append an uncommon letter, such as "X", to complete the
final digram.
5. The two letters of the digram are considered opposite corners of a rectangle
in the key table. To perform the substitution, apply the following 4 rules, in
order, to each pair of letters in the plaintext:
PROGRAM:
playfairCipher.java
import java.awt.Point;
import java.util.*;
class playfairCipher {
private static char[][] charTable;
private static Point[] positions;
private static String prepareText(String s, boolean chgJtoI) {
s = s.toUpperCase().replaceAll("[^A-Z]", "");
return chgJtoI ? s.replace("J", "I") : s.replace("Q", "");
}
private static void createTbl(String key, boolean chgJtoI) {
charTable = new char[5][5];
positions = new Point[26];
String s = prepareText(key + "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
chgJtoI);
int len = s.length();
for (int i = 0, k = 0; i < len; i++) {
char c = s.charAt(i); if (positions[c - 'A'] == null) {
charTable[k / 5][k % 5] = c;
positions[c - 'A'] = new Point(k % 5, k / 5);
k++;
}
}
}
private static String codec(StringBuilder txt, int dir) {
int len = txt.length();
for (int i = 0; i < len; i += 2) {
char a = txt.charAt(i);
char b = txt.charAt(i + 1);
int row1 = positions[a - 'A'].y;
int row2 = positions[b - 'A'].y;
int col1 = positions[a - 'A'].x;
int col2 = positions[b - 'A'].x;
if (row1 == row2) {
col1 = (col1 + dir) % 5;
col2 = (col2 + dir) % 5;
} else if (col1 == col2) {
row1 = (row1 + dir) % 5;
row2 = (row2 + dir) % 5;
} else {
int tmp = col1;
col1 = col2;
col2 = tmp;
}
txt.setCharAt(i, charTable[row1][col1]);
txt.setCharAt(i + 1, charTable[row2][col2]);
}
return txt.toString();
}
private static String encode(String s) {
StringBuilder sb = new StringBuilder(s);
for (int i = 0; i < sb.length(); i += 2) {
if (i == sb.length() - 1) { sb.append(sb.length() % 2 == 1 ? 'X' : "");
} else if (sb.charAt(i) == sb.charAt(i + 1)) {
sb.insert(i + 1, 'X');
}
}
return codec(sb, 1);
}
private static String decode(String s) {
return codec(new StringBuilder(s), 4);
}
public static void main(String[] args) throws java.lang.Exception {
Scanner x=new Scanner(System.in);
System.out.println(“Enter the Plain Text:”);
String txt=x.nextLine();
System.out.println(“Enter the key:”);
String key=x.nextLine();
boolean chgJtoI = true;
createTbl(key, chgJtoI);
String enc = encode(prepareText(txt, chgJtoI));
System.out.println("Simulating Playfair Cipher\n----------------------");
System.out.println("Input Message : " + txt);
System.out.println("Encrypted Message : " + enc);
System.out.println("Decrypted Message : " + decode(enc));
}
}

OUTPUT:
Simulating Playfair Cipher
----------------------
Enter the Plain Text:Security Lab
Enter the Key:CSE
Encrypted Message : EABPUGYANSEZ
Decrypted Message : SECURITYLABX

RESULT:
Thus the program for playfair cipher encryption and decryption algorithm has been
implemented and the output verified successfully.
Ex. No1(c) Hill Cipher
Date :

AIM:
To implement a program to encrypt and decrypt using the Hill cipher
substitution technique
ALGORITHM:
1. In the Hill cipher Each letter is represented by a number modulo 26.
2. To encrypt a message, each block of n letters is multiplied by an invertible n
x n matrix, again modulus 26.
3. To decrypt the message, each block is multiplied by the inverse of the matrix
used for encryption.
4. The matrix used for encryption is the cipher key, and it should be chosen
randomly from the set of invertible n × n matrices (modulo 26).
5. The cipher can, be adapted to an alphabet with any number of letters.
6. All arithmetic just needs to be done modulo the number of letters instead of
modulo 26.
PROGRAM:
HillCipher.java
import java.util.*;
import java.io.*;
public class NewClass {
private static int inv(int d)
{
int i=2,m=0;
while(i<=26)
{
if((d*i)%26==1)
{
m=i; break;
}
i++;
}
return m;

}
private static int[][] adjk(int[][]b){
int [][]a=new int [3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
a[i][j]=((b[(j+1)%3][(i+1)%3]*b[(j+2)%3][(i+2)%3])-
(b[(j+2)%3][(i+1)%3]*b[(j+1)%3][(i+2)%3]))%26;
 }

}
return a;

}
private static int[] MUL_MATRIX(int []d,int[][]a,int len)
{
int []h=new int[30];
int []r=d;
int []q=new int [30];
int j=len;
int io=0;
int k=0;
while(len>io)
{

int x=0;

for(int i=0;i<3;i++)
{
for(int v=0;v<3;v++)
{
x+=r[v+k]*a[v][i];
}
q[i+k]=x;
x=0;
}

k=k+3;
io++;

for(int i=0;i<len*3;i++)
{
h[i] = (q[i]%26);

}
return h;

public static void main(String ARGS[]){

Scanner s=new Scanner(System.in);
 String alphabet="ABCDEFGHIJKLMNOPQRSTUVWXYZ",KEY="",j,plain,we,suc =
null;
int [][]a=new int[3][3];
int [][]lp=new int[3][3];
int []h=new int[30];
int c=0;
char l;
int[]p=new int [30];
int []r=new int [30];
int []q=new int [30];
int t;
System.out.print("enter the key : " +" ");
KEY=s.nextLine();
j= KEY.toUpperCase();

t=0;
System.out.println(j);
while(KEY.length()!=t)
{

c=alphabet.indexOf(j.charAt(t));

p[t]=c;
t++;
}
int sub=0;
for(int i=0;i<3;i++){
for(int v=0;v<3;v++)
{
a[i][v]= p[sub];
sub++;
}
}
for(int i=0;i<3;i++){
for(int v=0;v<3;v++)
{
System.out.print(" "+a[i][v]+" ");
}
System.out.println();
}

System.out.println("enter the plaintext");

plain=s.nextLine();

we=plain.toUpperCase();
int value=plain.length();

int mod=value%3;
 if(mod==1)
{
suc=we.concat("ZZ");
}
else if(mod==2)
{
suc=we.concat("Z");
}
else
{
suc=we.concat("");
}
System.out.println("*****************");

int len=suc.length()/3;

t=0;
System.out.println("PLAINTEXT VALUE:");
while(suc.length()!=t)
{

c=alphabet.indexOf(suc.charAt(t));

r[t]=c;
t++;
}

for(int v=0;v<suc.length();v++)
{
System.out.print(r[v]+" ");
}

h=MUL_MATRIX(r,a,len);
t=0;

int rs=plain.length();
System.out.println("ENCRYPTION:==>");
while(rs>t)
{

l=alphabet.charAt(h[t]);

System.out.println(l);
t++;
}

int det1=(a[0][0]*((a[1][1]*a[2][2])-(a[2][1]*a[1][2])));
int det2=(a[0][1]*((a[1][0]*a[2][2])-(a[2][0]*a[1][2])));
int det3=(a[0][2]*((a[1][0]*a[2][1])-(a[2][0]*a[1][1])));
int det=det1-det2+det3;
int detv=det%26;

if (detv<0)
{
detv=detv+26;
}
int idetv=inv(detv);
System.out.println("DETERMINANT:===>"+idetv);
int [][]ad=new int[3][3];
ad=adjk(a);

for(int i=0;i<3;i++)
{
for(int n=0;n<3;n++)
{
if(ad[i][n]<0)
{
ad[i][n]+=26;
}
}

}
System.out.println("ADJACENT MATRIX: =>");
for(int f=0;f<3;f++){
for(int v=0;v<3;v++)
{
System.out.print(" "+ad[f][v]+" ");
}
System.out.println();
}
for(int i=0;i<3;i++)
{
for(int n=0;n<3;n++)
{
lp[i][n]=(ad[i][n]*idetv)%26;
}

}
int []pt=new int[30];

System.out.println("INVERSE MATRIX : ==>");

for(int i=0;i<3;i++)
{
for(int n=0;n<3;n++)
{
System.out.print(" "+lp[i][n]+" ");
}
 System.out.println();
}

pt=MUL_MATRIX(h,lp,len);
t=0;
System.out.println("DECRYPTION:==>");
while(rs>t)
{

l=alphabet.charAt(pt[t]);

System.out.print(l);
t++;
}
}}

OUTPUT:
Simulating Hill Cipher
-------------------------------
Enter the Key : RRFYSVCCT
Enter the PlainText:Paymoremoney
Encrypted Message : RRLMWBKASVON
Decrypted Message : PAYMOREMONEY

RESULT:
Thus the program for hill cipher encryption and decryption algorithm has
been implemented and the output verified successfully.
Ex. No : 1(d) Vigenere Cipher
Date :

AIM:
To implement a program for encryption and decryption using vigenere
cipher substitution technique

ALGORITHM:

1. The Vigenere cipher is a method of encrypting alphabetic text by using a

series of different Caesar ciphers based on the letters of a keyword.
2. It is a simple form of polyalphabetic substitution.
3. To encrypt, a table of alphabets can be used, termed a Vigenere square, or
Vigenere table.
4. It consists of the alphabet written out 26 times in different rows, each
alphabet shifted cyclically to the left compared to the previous alphabet,
corresponding to the 26 possible Caesar ciphers.
5. At different points in the encryption process, the cipher uses a different
alphabet from one of the rows used.
6. The alphabet at each point depends on a repeating keyword.

PROGRAM:
vigenereCipher.java

Import java.util.*;
public class vigenereCipher {
static String encode(String text, final String key) {
String res = "";
text = text.toUpperCase();
for (int i = 0, j = 0; i < text.length(); i++) {
char c = text.charAt(i);
if (c < 'A' || c > 'Z') {
continue;
}
res += (char) ((c + key.charAt(j) - 2 * 'A') % 26 + 'A');
j = ++j % key.length();
}
return res;
}
static String decode(String text, final String key) {
String res = "";
text = text.toUpperCase(); for (int i = 0, j = 0; i < text.length(); i++) {
char c = text.charAt(i);
if (c < 'A' || c > 'Z') {
continue;
}
res += (char) ((c - key.charAt(j) + 26) % 26 + 'A');
j = ++j % key.length();
}
return res;
}
public static void main(String[] args) throws java.lang.Exception {
Scanner x=new Scanner(System.in);
System.out.println(“Enter the Plain Text:”);
String txt=x.nextLine();
System.out.println(“Enter the key:”);
String key=x.nextLine();
System.out.println("Simulating Vigenere Cipher\n------------------------");
System.out.println("Input Message : " + msg);
String enc = encode(msg, key);
System.out.println("Encrypted Message : " + enc);
System.out.println("Decrypted Message : " + decode(enc, key));
}
}
OUTPUT:
Simulating Vigenere Cipher
------------------------
Enter the Plain Text:SecurityLaboratory
Enter the Key:Vigenerecipher
Encrypted Message : NMIYEMKCNIQVVROWXC
Decrypted Message : SECURITYLABORATORY

RESULT:
Thus the program for vigenere cipher encryption and decryption algorithm
has been implemented and the output verified successfully.
Ex. No : 2(a) Rail Fence Cipher Transposition Technique
Date :

AIM:

To implement a program for encryption and decryption using rail fence

transposition technique.

ALGORITHM:

1. In the rail fence cipher, the plaintext is written downwards and diagonally on
successive "rails" of an imaginary fence, then moving up when we reach the
bottom rail.
2. When we reach the top rail, the message is written downwards again until
the whole plaintext is written out.
3. The message is then read off in rows.

PROGRAM:
railFenceCipher.java
import java.util.*;
public class RailFence {
public static void main(String arss[])
{
String al="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
Scanner x=new Scanner(System.in);
System.out.println("enter the plain text");
String plain=x.nextLine();
String p=plain.toUpperCase();
int len=plain.length();
System.out.println("enter the depth");
int depth=x.nextInt();
char a[][]=new char[depth][len];
int j=0;
int i=0;
int flag=0;
while(j<len)
{
a[i][j]=p.charAt(j);
if(i==0)
{
i++;
flag=0;

}
else if(i==depth-1)
{
 i--;
flag=1;
}
else if((i>0||i<depth-1)&&flag==0)
{
flag=0;
i++;
}
else
{
flag=1;
i--;
}
j++;
}
System.out.println("RAILFENCE: =>");
for(int f=0;f<depth;f++){
for(int v=0;v<len;v++)
{

System.out.print(" "+(a[f][v])+" ");

}
System.out.println();
}

String s="";
for(int f=0;f<depth;f++){
for(int v=0;v<len;v++)
{
s=s+a[f][v];

}
System.out.println();
}

System.out.println(s);

}
OUTPUT:
Simulating Railfence Cipher
----------------------------------------
Enter the PlainText: Anna University, Chennai
Enter the depth:3
Encrypted Message : An nvriy hnanaUiest,Ceni
Decrypted Message : Anna University, Chennai

RESULT:
Thus the java program for Rail Fence Transposition Technique has been
implemented and the output verified successfully.
Ex. No : 2(b) Row and Column Transformation Technique
Date :

AIM:
To implement a program for encryption and decryption by using row and
column transformation technique.

ALGORITHM:
1. Consider the plain text hello world, and let us apply the simple columnar
transposition technique as shown below

h e l
l o w
o r l
d

2. The plain text characters are placed horizontally and the cipher text is
created with vertical format as: holewdlo lr.
3. Now, the receiver has to use the same table to decrypt the cipher text to
plain text.

PROGRAM:
TransCipher.java
import java.util.*;
public class rowColumntranS {

public static void main(String arss[])

{
Scanner s=new Scanner(System.in);
String mes="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
System.out.println("enter the value of rows");
int a=s.nextInt();
System.out.println("enter the value of columns");
int b=s.nextInt();
int arr [][]=new int [a][b];
int brr [][]=new int [a][b];
System.out.println("PLAINTEXT(the length of the plain text should be less than )"+a*b);
String plain=s.next();
int len=plain.length();
System.out.println(len);
int ba=a*b;
if(len<ba)
{
int y=ba-len;
 plain=plain+mes.substring(26-y,26);
}
plain=plain.toUpperCase();
System.out.println(plain);

for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{
int o=mes.indexOf(plain.charAt(((i*b)+j)));
arr[i][j]=o;
}

}
System.out.println("row column matrix");
for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{

System.out.print( " "+mes.charAt(arr[i][j])+" " );

System.out.println();
}
System.out.println("enter the key from value 0 to"+(b-1));
int[] key=new int [40];
for(int i=0;i<b;i++)
{
key[i]=s.nextInt();
}

System.out.println("encrypted message");
String temp="";
for(int i=0;i<b;i++)
{
for(int j=0;j<a;j++)
{

char d=mes.charAt(arr[j][key[i]]);
temp+=d;

}}

System.out.println(temp);
// System.out.println("decryption");
 for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{
int o=mes.indexOf(temp.charAt(((i*b)+j)));
brr[i][j]=o;
}

}
for(int i=0;i<a;i++)
{
for(int j=0;j<b;j++)
{

System.out.print( " "+mes.charAt(brr[i][j])+" " );

System.out.println();
}
}
}

OUTPUT:
Enter the plain text
Security Lab
SecurityLab
Sreictuy

RESULT:
Thus the java program for Row and Column Transposition Technique has
been implemented and the output verified successfully.
Ex. No : 3 Data Encryption Standard (DES) Algorithm
Date : (User Message Encryption )

AIM:
To use Data Encryption Standard (DES) Algorithm for a practical
application like User Message Encryption.

ALGORITHM:

1. Create a DES Key.

2. Create a Cipher instance from Cipher class, specify the following
information and separated by a slash (/).
a. Algorithm name
b. Mode (optional)
c. Padding scheme (optional)
3. Convert String into Byte[] array format.
4. Make Cipher in encrypt mode, and encrypt it with Cipher.doFinal() method.
5. Make Cipher in decrypt mode, and decrypt it with Cipher.doFinal() method.

PROGRAM:
DES.java
import java.security.InvalidKeyException;
import java.util.*;
import java.security.NoSuchAlgorithmException;
import javax.crypto.BadPaddingException;
import javax.crypto.Cipher;
import javax.crypto.IllegalBlockSizeException;
import javax.crypto.KeyGenerator;
import javax.crypto.NoSuchPaddingException;
import javax.crypto.SecretKey;
public class DES
{
public static void main(String[] argv) {
try{
System.out.println("Message Encryption Using DES Algorithm\n-------");
KeyGenerator keygenerator = KeyGenerator.getInstance("DES");
SecretKey myDesKey = keygenerator.generateKey();
Cipher desCipher; desCipher = Cipher.getInstance("DES/ECB/PKCS5Padding");
desCipher.init(Cipher.ENCRYPT_MODE, myDesKey);
byte[] text = "Secret Information ".getBytes();
System.out.println("Message [Byte Format] : " + text);
System.out.println("Message : " + new String(text));
byte[] textEncrypted = desCipher.doFinal(text);
System.out.println("Encrypted Message: " + textEncrypted);
desCipher.init(Cipher.DECRYPT_MODE, myDesKey);
byte[] textDecrypted = desCipher.doFinal(textEncrypted);
System.out.println("Decrypted Message: " + new
String(textDecrypted));
}catch(NoSuchAlgorithmException e){
e.printStackTrace();
}catch(NoSuchPaddingException e){
e.printStackTrace();
}catch(InvalidKeyException e){
e.printStackTrace();
}catch(IllegalBlockSizeException e){
e.printStackTrace();
}catch(BadPaddingException e){
e.printStackTrace();
}
}
}

OUTPUT:
Message Encryption Using DES Algorithm
------------------------------------------------------
Message [Byte Format] : [B@4dcbadb4
Message : Secret Information
Encrypted Message: [B@504bae78
Decrypted Message: Secret Information

RESULT:
Thus the java program for DES Algorithm has been implemented and the
output verified successfully.
Ex. No : 4 Advanced Encryption Standard (DES) Algorithm
Date : ( URL Encryption )

AIM:
To use Advanced Encryption Standard (AES) Algorithm for a practical
application like URL Encryption.

ALGORITHM:

1. AES is based on a design principle known as a substitution–permutation.

2. AES does not use a Feistel network like DES, it uses variant of Rijndael.
3. It has a fixed block size of 128 bits, and a key size of 128, 192, or 256 bits.
4. AES operates on a 4 × 4 column-major order array of bytes, termed the state

PROGRAM:
AES.java
import java.io.UnsupportedEncodingException;
import java.util.*;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.Arrays;
import java.util.Base64;
import javax.crypto.Cipher;
import javax.crypto.spec.SecretKeySpec;
public class AES {
private static SecretKeySpec secretKey;
private static byte[] key;
public static void setKey(String myKey) {
MessageDigest sha = null;
try {
key = myKey.getBytes("UTF-8");
sha = MessageDigest.getInstance("SHA-1");
key = sha.digest(key);
key = Arrays.copyOf(key, 16);
secretKey = new SecretKeySpec(key, "AES");
} catch (NoSuchAlgorithmException e) { e.printStackTrace();
} catch (UnsupportedEncodingException e) {
e.printStackTrace();
}
}
public static String encrypt(String strToEncrypt, String secret) {
try {
setKey(secret);
Cipher cipher = Cipher.getInstance("AES/ECB/PKCS5Padding");
cipher.init(Cipher.ENCRYPT_MODE, secretKey);
return
Base64.getEncoder().encodeToString(cipher.doFinal(strToEncrypt.getBytes("UTF -8")));
} catch (Exception e) {
System.out.println("Error while encrypting: " + e.toString());
}
return null;
}
public static String decrypt(String strToDecrypt, String secret) {
try {
setKey(secret);
Cipher cipher = Cipher.getInstance("AES/ECB/PKCS5PADDING");
cipher.init(Cipher.DECRYPT_MODE, secretKey);
return new
String(cipher.doFinal(Base64.getDecoder().decode(strToDecrypt)));
} catch (Exception e) {
System.out.println("Error while decrypting: " + e.toString());
}
return null;
}
public static void main(String[] args) {
Scanner x=new Scanner(System.in);
System.out.println(“Enter the Plain Text:”);
String txt=x.nextLine();
System.out.println(“Enter the key:”);
String encryptedString = AES.encrypt(originalString, secretKey);
String decryptedString = AES.decrypt(encryptedString, secretKey); System.out.println("URL
Encryption Using AES Algorithm\n------------");
System.out.println("Original URL : " + originalString);
System.out.println("Encrypted URL : " + encryptedString);
System.out.println("Decrypted URL : " + decryptedString);
}
}

OUTPUT:
URL Encryption Using AES Algorithm
-------------------------------------------------
Enter the Plain Text: www.annauniv.edu
Enter the Key: annaUniversity
Encrypted URL : vibpFJW6Cvs5Y+L7t4N6YWWe07+JzS1d3CU2h3mEvEg=
Decrypted URL : www.annauniv.edu

RESULT:
Thus the java program for AES Algorithm has been implemented for URL
Encryption and the output verified successfully.
Ex. No : 5 RSA Algorithm
Date :

AIM:
To implement RSA (Rivest–Shamir–Adleman) algorithm by using HTML
and Javascript.

ALGORITHM:

1. Choose two prime number p and q

2. Compute the value of n and p
3. Find the value of e (public key)
4. Compute the value of d (private key) using gcd()
5. Do the encryption and decryption
a. Encryption is given as,
c = te mod n
b. Decryption is given as,
t = cd mod n
PROGRAM:
rsa.html
<html>
<head>
<title>RSA Encryption</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0">
</head>
<body>
<center>
<h1>RSA Algorithm</h1>
<h2>Implemented Using HTML & Javascript</h2>
<hr>
<table>
<tr>
<td>Enter First Prime Number:</td>
<td><input type="number" value="53" id="p"></td>
</tr>
<tr>
<td>Enter Second Prime Number:</td>
<td><input type="number" value="59" id="q"></p> </td>
</tr>
<tr>
<td>Enter the Message(cipher text):<br>[A=1, B=2,...]</td>
<td><input type="number" value="89" id="msg"></p>
</td>
</tr>
<tr>
<td>Public Key:</td>
<td>
<p id="publickey"></p>
</td>
</tr>
<tr>
<td>Exponent:</td>
<td>
<p id="exponent"></p>
</td>
</tr>
<tr>
<td>Private Key:</td>
<td>
<p id="privatekey"></p>
</td>
</tr>
<tr>
<td>Cipher Text:</td>
<td>
<p id="ciphertext"></p>
</td>
</tr>
<tr>
<td><button onclick="RSA();">Apply RSA</button></td>
</tr>
</table>
</center>
</body>
<script type="text/javascript">
function RSA() {
var gcd, p, q, no, n, t, e, i, x; gcd = function (a, b) { return (!b) ? a : gcd(b, a % b); };
p = document.getElementById('p').value;
q = document.getElementById('q').value;
no = document.getElementById('msg').value;
n = p * q;
t = (p - 1) * (q - 1);
for (e = 2; e < t; e++) {
if (gcd(e, t) == 1) {
break;
}
}
for (i = 0; i < 10; i++) {
x=1+i*t
if (x % e == 0) {
d = x / e;
break;
}
}
ctt = Math.pow(no, e).toFixed(0);
ct = ctt % n;
dtt = Math.pow(ct, d).toFixed(0);
dt = dtt % n;
document.getElementById('publickey').innerHTML = n;
document.getElementById('exponent').innerHTML = e;
document.getElementById('privatekey').innerHTML = d;
document.getElementById('ciphertext').innerHTML = ct;
}
</script>
</html>

RESULT:
Thus the RSA algorithm has been implemented using HTML & CSS and the
output has been verified successfully.
Ex. No : 6 Diffie-Hellman key exchange algorithm
Date :

AIM:
To implement the Diffie-Hellman Key Exchange algorithm for a given
problem .

ALGORITHM:

1. Alice and Bob publicly agree to use a modulus p = 23 and base g = 5 (which
is a primitive root modulo 23).
2. Alice chooses a secret integer a = 4, then sends Bob A = ga mod p
o A = 54 mod 23 = 4
3. Bob chooses a secret integer b = 3, then sends Alice B = gb mod p
o B = 53 mod 23 = 10
4. Alice computes s = Ba mod p
o s = 104 mod 23 = 18
5. Bob computes s = Ab mod p
o s = 43 mod 23 = 18
7. Alice and Bob now share a secret (the number 18).
8.
PROGRAM:
DiffieHellman.java

import java.util.*;
class DiffieHellman {
public static void main(String args[]) {
Scanner k=new Scanner(System.in);
System.out.println(“Enter the Prime number”);
int p = k.nextInt(); /* publicly known (prime number) */
System.out.println(“Enter the Primitive root”);
int g = k.nextInt(); /* publicly known (primitive root) */
System.out.println(“Enter the Alice secret key”);
int x = k.nextInt(); /* only Alice knows this secret */
System.out.println(“Enter the Bob secret key”);
int y = k.nextInt(); /* only Bob knows this secret */
double aliceSends = (Math.pow(g, x)) % p;
double bobComputes = (Math.pow(aliceSends, y)) % p;
double bobSends = (Math.pow(g, y)) % p;
double aliceComputes = (Math.pow(bobSends, x)) % p;
double sharedSecret = (Math.pow(g, (x * y))) % p;
System.out.println("simulation of Diffie-Hellman key exchange algorithm\n--
-------------------------------------------");
System.out.println("Alice Sends : " + aliceSends);
System.out.println("Bob Computes : " + bobComputes);
System.out.println("Bob Sends : " + bobSends); System.out.println("Alice Computes : " +
aliceComputes);
System.out.println("Shared Secret : " + sharedSecret);
/* shared secrets should match and equality is transitive */
if ((aliceComputes == sharedSecret) && (aliceComputes == bobComputes))
System.out.println("Success: Shared Secrets Matches! " + sharedSecret);
else
System.out.println("Error: Shared Secrets does not Match");
}
}

OUTPUT:
simulation of Diffie-Hellman key exchange algorithm
-----------------------------------------------------------------
Enter the Prime number 23
Enter the Primitive root 5
Enter the Alice secret key 4
Enter the Bob secret key 3
Alice Sends : 4.0
Bob Computes : 18.0
Bob Sends : 10.0
Alice Computes : 18.0
Shared Secret : 18.0
Success: Shared Secrets Matches! 18.0

RESULT:
Thus the Diffie-Hellman key exchange algorithm has been implemented
using Java Program and the output has been verified successfully.
Ex. No : 7 SHA-1 Algorithm
Date :

AIM:
To Calculate the message digest of a text using the SHA-1 algorithm.

ALGORITHM:

1. Append Padding Bits

2. Append Length - 64 bits are appended to the end
3. Prepare Processing Functions
4. Prepare Processing Constants
5. Initialize Buffers
6. Processing Message in 512-bit blocks (L blocks in total message)

PROGRAM:
sha1.java

import java.util.*;
import java.security.*;
public class sha1 {
public static void main(String[] a) {
try {
Scanner s=new Scanner(System.in);
MessageDigest md = MessageDigest.getInstance("SHA1");
System.out.println("Message digest object info:\n-----------------");
System.out.println("Algorithm=" + md.getAlgorithm());
System.out.println("Provider=" + md.getProvider());
System.out.println("ToString=" + md.toString());
String input = "";
md.update(input.getBytes());
byte[] output = md.digest();
System.out.println();
System.out.println("SHA1(\"" + input + "\")=" + bytesToHex(output));
input = “abc;
md.update(input.getBytes());
output = md.digest();
System.out.println();
System.out.println("SHA1(\"" + input + "\")=" + bytesToHex(output));
input = "abcdefghijklmnopqrstuvwxyz";
md.update(input.getBytes()); output = md.digest();
System.out.println();
System.out.println("SHA1(\"" + input + "\")=" + bytesToHex(output));
System.out.println();
} catch (Exception e) {
System.out.println("Exception:" + e);
}
}
private static String bytesToHex(byte[] b) {
char hexDigit[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
StringBuffer buf = new StringBuffer();
for (byte aB : b) {
buf.append(hexDigit[(aB >> 4) & 0x0f]);
buf.append(hexDigit[aB & 0x0f]);
}
return buf.toString();
}
}

OUTPUT:
Message digest object info:
-------------------------------------
Algorithm=SHA1
Provider=SUN version 12
ToString=SHA1 Message Digest from SUN, <initialized>
SHA1("")=DA39A3EE5E6B4B0D3255BFEF95601890AFD80709
SHA1("abc")=A9993E364706816ABA3E25717850C26C9CD0D89D
SHA1("abcdefghijklmnopqrstuvwxyz")=32D10C7B8CF96570CA04CE37F2A19
D84240D3A89

RESULT:
Thus the Secure Hash Algorithm (SHA-1) has been implemented and the
output has been verified successfully.
Ex. No : 8 Digital Signature Standard
Date :

AIM:
To implement the SIGNATURE SCHEME - Digital Signature Standard.

ALGORITHM:

1. Create a KeyPairGenerator object.

2. Initialize the KeyPairGenerator object.
3. Generate the KeyPairGenerator. ...
4. Get the private key from the pair.
5. Create a signature object.
6. Initialize the Signature object.
7. Add data to the Signature object
8. Calculate the Signature

PROGRAM:

import java.util.*;
import java.math.BigInteger;
class dsaAlg {
final static BigInteger one = new BigInteger("1");
final static BigInteger zero = new BigInteger("0"); /* incrementally tries for next prime */
public static BigInteger getNextPrime(String ans) {
BigInteger test = new BigInteger(ans);
while (!test.isProbablePrime(99))
{
test = test.add(one);
}
return test;
} /* finds largest prime factor of n */
public static BigInteger findQ(BigInteger n)
{
BigInteger start = new BigInteger("2");
while (!n.isProbablePrime(99))
{
while (!((n.mod(start)).equals(zero)))
{
start = start.add(one);
}
68 n = n.divide(start);
}
return n;
} /* finds a generator mod p */
public static BigInteger getGen(BigInteger p, BigInteger q, Random r)
{
BigInteger h = new BigInteger(p.bitLength(), r);
h = h.mod(p);
return h.modPow((p.subtract(one)).divide(q), p);
}
public static void main (String[] args) throws java.lang.Exception {
Random randObj = new Random(); /* establish the global public key components */
BigInteger p = getNextPrime("10600"); /* approximate prime */
BigInteger q = findQ(p.subtract(one));
BigInteger g = getGen(p,q,randObj); /*publickeycomponents*/
System.out.println("Digital Signature Algorithm");
System.out.println("global public key components are:");
System.out.println("p is: " + p);
System.out.println("q is: " + q);
System.out.println("g is: " + g); /* find the private key */
BigInteger x = new BigInteger(q.bitLength(), randObj);
x = x.mod(q); /* corresponding public key */
BigInteger y = g.modPow(x,p); /* random value message */
BigInteger k = new BigInteger(q.bitLength(), randObj);
k = k.mod(q); /* randomly generated hash value and digital signature */
BigInteger r = (g.modPow(k,p)).mod(q);
BigInteger hashVal = new BigInteger(p.bitLength(), randObj);
BigInteger kInv = k.modInverse(q);
BigInteger s = kInv.multiply(hashVal.add(x.multiply(r)));
s = s.mod(q); 69 /* secret information */
System.out.println("secret information are:");
System.out.println("x (private) is: " + x);
System.out.println("k (secret) is: " + k);
System.out.println("y (public) is: " + y);
System.out.println("h (rndhash) is: " + hashVal);
System.out.println("Generating digital signature:");
System.out.println("r is : " + r);
System.out.println("s is : " + s); /*verify the digital signature */
BigInteger w = s.modInverse(q);
BigInteger u1 = (hashVal.multiply(w)).mod(q);
BigInteger u2 = (r.multiply(w)).mod(q);
BigInteger v = (g.modPow(u1,p)).multiply(y.modPow(u2,p));
v = (v.mod(p)).mod(q);
System.out.println("verifying digital signature (checkpoints):");
System.out.println("w is : " + w);
System.out.println("u1 is : " + u1);
System.out.println("u2 is : " + u2);
System.out.println("v is : " + v);
if (v.equals(r)) {
System.out.println("success: digital signature is verified! " + r);
}
 else {
System.out.println("error: incorrect digital signature");
}}}

OUTPUT:

Digital Signature Algorithm

global public key components are
P is :10601
q is :53
g is :1910
Secret information are :
x <private> is :6
k <secret> is :20
y <public> is :2619
h <rndhash> is:1105
Generating digital signature :
r is :43
s is :39
Verify digital signature <checkpoints>:
w is :34
u1 is :46
u2 is :31
v is :43
Success digital signature is verified! 43

RESULT:
Thus the Digital Signature Standard Signature Scheme has been
implemented and the output has been verified successfully.
Ex. No : 9 Demonstration of Intrusion Detection System(IDS)
Date :

AIM:
To demonstrate Intrusion Detection System (IDS) using Snort software tool.

STEPS ON CONFIGURING AND INTRUSION DETECTION:

1. Download Snort from the Snort.org website. (http://www.snort.org/snort

downloads)
2. Download Rules(https://www.snort.org/snort-rules). You must register to get the
rules. (You should download these often)
3. Double click on the .exe to install snort. This will install snort in the “C:\Snort”
folder.It is important to have WinPcap (https://www.winpcap.org/install/) installed
4. Extract the Rules file. You will need WinRAR for the .gz file.
5. Copy all files from the “rules” folder of the extracted folder. Now paste the
rules into “C:\Snort\rules” folder.
6. Copy “snort.conf” file from the “etc” folder of the extracted folder. You must
paste it into “C:\Snort\etc” folder. Overwrite any existing file. Remember if
you modify your snort.conf file and download a new file, you must modify it for
Snort to work.
7. Open a command prompt (cmd.exe) and navigate to folder “C:\Snort\bin”
folder. ( at the Prompt, type cd\snort\bin)
8. To start (execute) snort in sniffer mode use following command:
snort -dev -i 3
-i indicates the interface number. You must pick the correct interface number. In
my case, it is 3.
-dev is used to run snort to capture packets on your network.
To check the interface list, use following command:
snort -W
Finding an interface
You can tell which interface to use by looking at the Index number and finding
Microsoft. As you can see in the above example, the other interfaces are for
VMWare. My interface is 3.
9. To run snort in IDS mode, you will need to configure the file “snort.conf”
according to your network environment.
10. To specify the network address that you want to protect in snort.conf file, look
for the following line.
var HOME_NET 192.168.1.0/24 (You will normally see any here)
11. You may also want to set the addresses of DNS_SERVERS, if you have some
on your network.
Example:
example snort
12. Change the RULE_PATH variable to the path of rules folder.
var RULE_PATH c:\snort\rules
path to rules13. Change the path of all library files with the name and path on your system. and
you must change the path of snort_dynamicpreprocessorvariable.
C:\Snort\lib\snort_dynamiccpreprocessor
You need to do this to all library files in the “C:\Snort\lib” folder. The old path
might be: “/usr/local/lib/…”. you will need to replace that path with your system
path. Using C:\Snort\lib
14. Change the path of the “dynamicengine” variable value in the “snort.conf”
file..
Example:
dynamicengine C:\Snort\lib\snort_dynamicengine\sf_engine.dll
15 Add the paths for “include classification.config” and “include reference.config”
files.
include c:\snort\etc\classification.config
include c:\snort\etc\reference.config
16. Remove the comment (#) on the line to allow ICMP rules, if it is commented
with a #.
include $RULE_PATH/icmp.rules
17. You can also remove the comment of ICMP-info rules comment, if it is
commented.
include $RULE_PATH/icmp-info.rules
18. To add log files to store alerts generated by snort, search for the “output log”
test in snort.conf and add the following line:
output alert_fast: snort-alerts.ids
19. Comment (add a #) the whitelist $WHITE_LIST_PATH/white_list.rules and
the blacklist
Change the nested_ip inner , \ to nested_ip inner #, \
20. Comment out (#) following lines:
#preprocessor normalize_ip4
#preprocessor normalize_tcp: ips ecn stream
#preprocessor normalize_icmp4
#preprocessor normalize_ip6
#preprocessor normalize_icmp621. Save the “snort.conf” file.
22. To start snort in IDS mode, run the following command:
snort -c c:\snort\etc\snort.conf -l c:\snort\log -i 3
(Note: 3 is used for my interface card)
If a log is created, select the appropriate program to open it. You can use
WordPard or NotePad++ to read the file.
To generate Log files in ASCII mode, you can use following command while
running snort in IDS mode:
snort -A console -i3 -c c:\Snort\etc\snort.conf -l c:\Snort\log -K ascii
23. Scan the computer that is running snort from another computer by using PING
or NMap (ZenMap).
After scanning or during the scan you can check the snort-alerts.ids file in the log
folder to insure it is logging properly. You will see IP address folders appear.
Snort monitoring traffic –
RESULT:
Thus the Intrusion Detection System(IDS) has been demonstrated by using
the Open Source Snort Intrusion Detection Tool.
Ex. No : 10 Exploring N-Stalker, a Vulnerability Assessment Tool
Date :

AIM:
To download the N-Stalker Vulnerability Assessment Tool and exploring the
features.

EXPLORING N-STALKER:


N-Stalker Web Application Security Scanner is a Web security assessment tool.

It incorporates with a well-known N-Stealth HTTP Security Scanner and 35,000
Web attack signature database.

This tool also comes in both free and paid version.

Before scanning the target, go to “License Manager” tab, perform the update.

Once update, you will note the status as up to date.

You need to download and install N-Stalker from www.nstalker.com.
1. Start N-Stalker from a Windows computer. The program is installed under
Start ➪ Programs ➪ N-Stalker ➪ N-Stalker Free Edition.
2. Enter a host address or a range of addresses to scan.
3. Click Start Scan.
4. After the scan completes, the N-Stalker Report Manager will prompt
5. you to select a format for the resulting report as choose Generate HTML.
6. Review the HTML report for vulnerabilities.
Now goto “Scan Session”, enter the target URL.
In scan policy, you can select from the four options,
 Manual test which will crawl the website and will be waiting for manual
attacks.

full xss assessment

owasp policy

Web server infrastructure analysis.
Once, the option has been selected, next step is “Optimize settings” which will
crawl the whole website for further analysis.
In review option, you can get all the information like host information,
technologies used, policy name, etc.Once done, start the session and start the scan.
The scanner will crawl the whole website and will show the scripts, broken pages,
hidden fields, information leakage, web forms related information which helps to
analyze further.

Once the scan is completed, the NStalker scanner will show details like severity
level, vulnerability class, why is it an issue, the fix for the issue and the URL
which is vulnerable to the particular vulnerability?
RESULT:
Thus the N-Stalker Vulnerability Assessment tool has been downloaded,
installed and the features has been explored by using a vulnerable website.
Ex. No : 11(a) Defeating Malware - Building Trojans
Date :

AIM:
To build a Trojan and know the harmness of the trojan malwares in a
computer system.

PROCEDURE:

1. Create a simple trojan by using Windows Batch File (.bat)

2. Type these below code in notepad and save it as Trojan.bat
3. Double click on Trojan.bat file.
4. When the trojan code executes, it will open MS-Paint, Notepad, Command
Prompt, Explorer, etc., infinitely.
4. Restart the computer to stop the execution of this trojan.

TROJAN:


In computing, a Trojan horse,or trojan, is any malware which misleads users
of its true intent.

Trojans are generally spread by some form of social engineering, for
example where a user is duped into executing an email attachment disguised
to appear not suspicious, (e.g., a routine form to be filled in), or by clicking
on some fake advertisement on social media or anywhere else.

Although their payload can be anything, many modern forms act as a
backdoor, contacting a controller which can then have unauthorized access
to the affected computer.

Trojans may allow an attacker to access users' personal information such as
banking information, passwords, or personal identity.

Example: Ransomware attacks are often carried out using a trojan.
CODE:
Trojan.bat
@echo off
:x
start mspaint
start notepad
start cmd
start explorer
start control
start calc
goto x
OUTPUT
(MS-Paint, Notepad, Command Prompt, Explorer will open infinitely)

RESULT:
Thus a trojan has been built and the harmness of the trojan viruses has been
explored.
Ex. No : 11(b) Defeating Malware - Rootkit hunter
Date :

AIM:
To install a rootkit hunter and find the malwares in a computer.

ROOTKIT HUNTER:

 rkhunter (Rootkit Hunter) is a Unix-based tool that scans for rootkits,

backdoors and possible local exploits.

It does this by comparing SHA-1 hashes of important files with known good
ones in online databases, searching for default directories (of rootkits),
wrong permissions, hidden files, suspicious strings in kernel modules, and
special tests for Linux and FreeBSD.

rkhunter is notable due to its inclusion in popular operating systems (Fedora,
Debian, etc.)

The tool has been written in Bourne shell, to allow for portability. It can run
on almost all UNIX-derived systems.

GMER ROOTKIT TOOL:

 GMER is a software tool written by a Polish researcher Przemysław

Gmerek, for detecting and removing rootkits.
 It runs on Microsoft Windows and has support for Windows NT, 2000, XP,
Vista, 7, 8 and 10. With version 2.0.18327 full support for Windows x64 is
added.

Step 1
Visit GMER's website (see Resources) and download the GMER executable.
Click the "Download EXE" button to download the program with a random file
name, as some rootkits will close “gmer.exe” before you can open it.
Step 2

Double-click the icon for the program.

Click the "Scan" button in the lower-right corner of the dialog box. Allow the
program to scan your entire hard drive.

Step 3
When the program completes its scan, select any program or file listed in red.
Right-click it and select "Delete."
If the red item is a service, it may be protected. Right-click the service and select
"Disable." Reboot your computer and run the scan again, this time selecting
"Delete" when that service is detected.
When your computer is free of Rootkits, close the program and restart your PC.

RESULT:
In this experiment a rootkit hunter software tool has been installed and the
rootkits have been detected