IMPLEMENTATION OF SHA-1 ALGORITHM using JAVA

-
Image
AIM: To   write a java program to calculate the message digest of a text using the SHA-1 algorithm ALGORITHM: Step 1: Input the plain text Step 2: Append padding bits Step 3: Append length Step 4:Initialize   buffer. Step 5: Process message in 512-bit (16word)blocks Step 6: Encrypted in hexa decimal format Step 7: Display the encrypted text. PROGRAM: importjava.security.*; public class SHA1 { public static void main(String[] a) { try { MessageDigest md = MessageDigest.getInstance("SHA1"); System.out.println("Message digest object info: "); 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(\""+...
Post a Comment

IT6712 SECURITY LABORATORY SYLLABUS

-
IT6712 SECURITY LABORATORY                                                                                         L T P C 0 0 3 2 
OBJECTIVES: 


  • The student should be made to:
  •  Be exposed to the different cipher techniques
  •  Learn to implement the algorithms DES, RSA,MD5,SHA-1
  •  Learn to use tools like GnuPG, KF sensor, Net Strumbler

LIST OF EXPERIMENTS
1. Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES concepts:
a) Caesar Cipher
b) Playfair Cipher
c) Hill Cipher
d) Vigenere Cipher
e) Rail fence – row & Column Transformation
2. Implement the following algorithms
a) DES
b) RSA Algorithm
c) Diffiee-Hellman
d) MD5
e) SHA-1
3 Implement the SIGNATURE SCHEME - Digital Signature Standard
4. Demonstrate how to provide secure data storage, secure data transmission and for creating digital signatures (GnuPG).
5. Setup a honey pot and monitor the honeypot on network (KF Sensor)
6. Installation of rootkits and study about the variety of options
7. Perform wireless audit on an access point or a router and decrypt WEP and WPA.( Net Stumbler)
8. Demonstrate intrusion detection system (ids) using any tool (snort or any other s/w)

                                                                                                               TOTAL: 45 PERIODS

LAB EQUIPMENTS FOR A BATCH OF 30 STUDENTS: SOFTWARE: 
C / C++ / Java or equivalent compiler GnuPG, KF Sensor or Equivalent, Snort, Net Stumbler or Equivalent

HARDWARE:
 Standalone desktops -30 Nos. (or) Server supporting 30 terminals or more

Comments

Post a Comment

Popular posts from this blog

IMPLEMENTATION OF SHA-1 ALGORITHM using JAVA

-
Image
AIM: To   write a java program to calculate the message digest of a text using the SHA-1 algorithm ALGORITHM: Step 1: Input the plain text Step 2: Append padding bits Step 3: Append length Step 4:Initialize   buffer. Step 5: Process message in 512-bit (16word)blocks Step 6: Encrypted in hexa decimal format Step 7: Display the encrypted text. PROGRAM: importjava.security.*; public class SHA1 { public static void main(String[] a) { try { MessageDigest md = MessageDigest.getInstance("SHA1"); System.out.println("Message digest object info: "); 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(\""+...
Read more

IMPLEMENTATION OF DIFFIE HELLMAN KEY EXCHANGE ALGORITHM

-
Image
AIM: To write a   C++ program   to implement   Diffie Hellman key exchange algorithm. ALGORITHM: Step 1: Enter the value of n and g, both are prime numbers. Step 2: Enter x and y and these are private chosen by the users alice and bob respectively. Step 3: Alice calculates g x mod n and Bob calculates g y mod n Step 4: Bob sends the value g y mod n to Alice and alice sends the value g x mod n to Bob. Step 5: Alice will calculate the shared secret by (g y mod n ) x mod n   and bob b(g x mod n ) y mod n. Step 6: Display the shared secret key. PROGRAM: // Diffie Hellman key Exchange #include<iostream> using namespace std; #include<math.h> intalice(int,double,double); int bob(int,double,double); int main( ) {    longint a,b,k1,k2,n; doubleg,x,y; cout<<"\n   DIFFIE HELLMAN KEY EXCHANGE"; cout<<"\n\n\t Enter value of n & g"; cin>>n>>g; ...
Read more

IMPLEMENTATION OF VIGENERE CIPHER using C++

-
Image
AIM:             Towrite a   C++ program to implement Vigenere   Cipher. ALGORITHM: Step 1: Enter the plain text   for encryption. Step 2: Enter   the   encryption key pharse. Step 3:   Cipher text is obtained by modular addition   of a   key pharse and   plain   text. Step 4: For decryption to get the plaintext again the key pharse is modularly subtracted from the cipher   text. Step 5: Display the cipher text and plaintext. PROGRAM: // Vigenere Cipher #include <iostream> #include <string> using namespace std; class Vigenere {     public:         string key; Vigenere(string key)         { for (int i = 0; i <key.size(); ++i)             {  ...
Read more