0% found this document useful (0 votes)

112 views20 pages

C and Java Programs for String Encryption

Q: In the Substitution Cipher, how is the encryption key used differently compared to the Caesar Cipher in encoding a message?

In a Substitution Cipher, each letter in the plaintext is mapped to a different letter independently of its position, forming a substitution pattern that does not necessarily shift by a consistent number of places, unlike the Caesar Cipher which relies on a uniform shift across the alphabet . The Substitution Cipher uses an arbitrary distinct mapping as encryption key, while the Caesar Cipher uses a fixed numerical shift key .

Q: What role does the key matrix play in the Hill Cipher process, and how does it affect the encryption of a message?

In the Hill Cipher, the key matrix is essential for performing the linear algebra-based transformation on message vectors. The message is represented in vector form, and a key matrix (derived from a key string) is used to perform matrix multiplication, converting the message vector into a cipher vector. This operation ensures that unless the key matrix is known, deciphering the cipher text is infeasible .

Q: How does the Caesar Cipher algorithm ensure the security of a message during encryption and decryption?

The Caesar Cipher ensures message security by shifting each letter of the input string by a fixed number of positions (key) in the alphabet. This transformation alters the original message to an encoded form that appears meaningless to unauthorized readers. To decrypt, the reverse shift is applied using the same key, restoring the original message .

Q: Analyze how SHA-1 algorithm functions to generate a message digest and discuss its susceptibility to cryptographic attacks.

SHA-1 generates a message digest through hash functions that compress the input string into a fixed-size (160-bit) hash value. It processes data in 512-bit chunks, iterating operations to create complex transformations of input data into a shorter hash. However, due to vulnerabilities such as collision attacks where different inputs produce the same hash, SHA-1 is considered weak against modern attacks, prompting a transition to more secure hash functions like SHA-256 .

Q: What distinguishes the MD5 algorithm from other hash functions, and why is it no longer considered secure?

MD5 distinguishes itself through its 128-bit hash output, employing a series of bitwise operations, modular additions, and compression functions. However, it is no longer considered secure due to susceptibility to collision attacks, where two different inputs can result in identical hash outputs, undermining its reliability for secure cryptographic applications .

Q: Explain the mathematical process by which RSA encryption transforms a plaintext message into ciphertext.

RSA encryption transforms plaintext by using a pair of keys, a public and a private key. The plaintext, represented as a numerical value, is raised to the power of the public exponent (e) modulo a product of two primes (n), producing the ciphertext. This operation provides security based on the difficulty of factoring large numbers into prime factors, as the inverse operation (decryption) requires the private exponent, calculable from the chosen primes and their totient .

Q: How does the Diffie-Hellman Key Exchange protocol facilitate secure key exchanges between two parties?

Diffie-Hellman facilitates secure key exchanges by allowing two parties to collaboratively generate a shared secret over an insecure channel without transmitting the secret itself. It uses large prime numbers and generators as public components and private keys chosen by each party. Each parties' public values are computed and exchanged; then, these are combined with the private key to generate the shared secret, making unwanted interception without private keys impractical .

Q: What is the observable output when XORing each character of a string with a zero?

When XORing each character of the string 'Hello World' with zero, the output remains the string itself, i.e., 'Hello World' because any number XORed with zero remains unchanged .

Q: Illustrate the process of encrypting a message using the Blowfish algorithm. How is the unique key generated and used?

In the Blowfish algorithm, encryption involves using a symmetric key to transform plain text into cipher text. A unique key is generated, typically as a random byte array, which is then used to initialize a secret key specification. The Blowfish cipher object is created and initialized with the secret key in ENCRYPT_MODE, leading to the encrypted text generation through cryptographic transformation of input data. The same key is required for decryption, demanding accurate key management .

Q: Discuss how DES algorithm achieves data encryption and decryption using secret key management.

DES achieves data encryption by using a symmetrical key (secret key) with a series of operations including permutation and substitution in blocks of data. During encryption, the key is applied to scramble plain text into cipher text, and the same key is used reversely to decrypt it. Key management is crucial in DES as both encryption and decryption require identical keys, emphasizing secure key exchanges .

The document contains multiple programming examples in C and Java for various encryption algorithms including XOR operations, Ceaser Cipher, Substitution Cipher, Hill Cipher, DES, Blowfish, Rijndael, RSA, and Diffie-Hellman. Each section outlines the aim, program code, and expected output for the respective algorithm. The examples demonstrate basic encryption and decryption techniques using different methods and key management strategies.

Uploaded by

Sasi Vallabhajosyula

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

112 views20 pages

C and Java Programs for String Encryption

Uploaded by

Sasi Vallabhajosyula

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

1.

XOR a string with a Zero

AIM: Write a C program that contains a string (char pointer) with a value \Hello
World’. The program should XOR each character in this string with 0 and
display the result.
PROGRAM:
#include<stdio.h>

#include<stdlib.h>

#include<string.h>

int main()

char str[]="Hello World";

char str1[11];

int i,len;

len=strlen(str);

for(i=0;i<len;i++)

str1[i]=str[i]^0;

printf("%c",str1[i]);

printf("\n");

Output:

./[Link]

Hello World

2. XOR a string with a 127

AIM: Write a C program that contains a string (char pointer) with a value \Hello
World’. The program should AND or and XOR each character in this string with
127 and display the result.

PROGRAM:
#include <stdio.h>

#include<stdlib.h>

#include<string.h>
void main()

char str[]="Hello World";

char str1[11];

char str2[11];

char str3[11];

int i,len;

len = strlen(str);

for(i=0;i<len;i++)

str1[i] = str[i]&127;

-printf("%c",str1[i]);

printf("\n");

for(i=0;i<len;i++)

str3[i] = str2[i]^127;

printf("%c",str3[i]);

printf("\n");

Output:

Hello World

�}�(�*

3. Encryption & Decryption using Cipher Algorithms

AIM: Write a Java program to perform encryption and decryption using the
following algorithms:
a) Ceaser Cipher
b) Substitution Cipher
c) Hill Cipher
PROGRAM:
d) Ceaser Cipher
import [Link];
import [Link];
import [Link];
import [Link];
public class CeaserCipher {
static Scanner sc=new Scanner([Link]);
static BufferedReader br = new BufferedReader(new InputStreamReader([Link]));
public static void main(String[] args) throws IOException {
// TODO code application logic here
[Link]("Enter any String: ");
String str = [Link]();
[Link]("\nEnter the Key: ");
int key = [Link]();
String encrypted = encrypt(str, key);
[Link]("\nEncrypted String is: " +encrypted);
String decrypted = decrypt(encrypted, key);
[Link]("\nDecrypted String is: "
+decrypted); [Link]("\n");
}
public static String encrypt(String str, int key)
{
String encrypted = "";
for(int i = 0; i < [Link](); i++) {
int c = [Link](i);
if ([Link](c)) {
c = c + (key % 26);
if (c > 'Z')
c = c - 26;
}
else if ([Link](c)) {
c = c + (key % 26);
if (c > 'z')
c = c - 26;
}
encrypted += (char) c;
}
return encrypted;
}
public static String decrypt(String str, int key)
{
String decrypted = "";
for(int i = 0; i < [Link](); i++) {
int c = [Link](i);
if ([Link](c)) {
c = c - (key % 26);
if (c < 'A')
c = c + 26;
}
else if ([Link](c)) {
c = c - (key % 26);
if (c < 'a')
c = c + 26;
}
decrypted += (char) c;
}
return decrypted;
}
}
Output:
Enter any String: Hello World
Enter the Key: 5
Encrypted String is: MjqqtBtwqi
Decrypted String is: Hello World

b) Substitution Cipher
PROGRAM:
import [Link].*;
import [Link].*;
public class SubstitutionCipher {
static Scanner sc = new Scanner([Link]);
static BufferedReader br = new BufferedReader(new InputStreamReader([Link]));
public static void main(String[] args) throws IOException {
// TODO code application logic here
String a = "abcdefghijklmnopqrstuvwxyz";
String b = "zyxwvutsrqponmlkjihgfedcba";
[Link]("Enter any string: ");
String str = [Link]();
String text = "";
char c;
for(int i=0;i<[Link]();i++)
{
c = [Link](i);
int j = [Link](c);
text = text+[Link](j);
}
[Link]("The encrypted data is: " +text);
}
}
Output:
Enter any string: aceho
The encrypted data is: zxvsl

a) Hill Cipher
PROGRAM:

class Hill
{
static void getKeyMatrix(String key, int keyMatrix[][])
{
int k = 0;
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
keyMatrix[i][j] = ([Link](k)) % 65;
k++;
}
}
}

static void encrypt(int cipherMatrix[][],

int keyMatrix[][],
int messageVector[][])
{
int x, i, j;
for (i = 0; i < 3; i++)
{
for (j = 0; j < 1; j++)
{
cipherMatrix[i][j] = 0;

for (x = 0; x < 3; x++)

{
cipherMatrix[i][j] +=
keyMatrix[i][x] * messageVector[x][j];
}

cipherMatrix[i][j] = cipherMatrix[i][j] % 26;

}
}
}

static void HillCipher(String message, String key)

{
int [][]keyMatrix = new int[3][3];
getKeyMatrix(key, keyMatrix);

int [][]messageVector = new int[3][1];

for (int i = 0; i < 3; i++)
messageVector[i][0] = ([Link](i)) % 65;

int [][]cipherMatrix = new int[3][1];

encrypt(cipherMatrix, keyMatrix, messageVector);

String CipherText="";
for (int i = 0; i < 3; i++)
CipherText += (char)(cipherMatrix[i][0] + 65);
[Link](" Ciphertext:" + CipherText);
}
public static void main(String[] args)
{
String message = "HAI";
String key = "GYBNQKURP";
HillCipher(message, key);
}
}
Output:
Ciphertext:YPA

4. Java program for DES algorithm logic

AIM: Write a Java program to implement the DES algorithm logic.
PROGRAM:

import [Link].*;

import [Link];

import [Link].*;

import [Link];

class DES{

public static void main(String[] args) throws IOException, NoSuchAlgorithmException,

InvalidKeyException, InvalidKeySpecException, NoSuchPaddingException,
IllegalBlockSizeException, BadPaddingException

//String we want to encrypt

String message="This is a confidential message.";

byte[] myMessage =[Link](); //string to byte array as DES works on bytes

//Generating Key

KeyGenerator Mygenerator = [Link]("DES");

SecretKey myDesKey = [Link]();

//initializing crypto algorithm

Cipher myCipher = [Link]("DES");

//setting encryption mode

[Link](Cipher.ENCRYPT_MODE, myDesKey);

byte[] myEncryptedBytes=[Link](myMessage);

//setting decryption mode

[Link](Cipher.DECRYPT_MODE, myDesKey);

byte[] myDecryptedBytes=[Link](myEncryptedBytes);

String encrypteddata=new String(myEncryptedBytes);

String decrypteddata=new String(myDecryptedBytes);

[Link]("Message : "+ message);

[Link]("Encrypted - "+ encrypteddata);

[Link]("Decrypted Message - "+ decrypteddata);

OUTPUT:

Message : This is a confidential message.

Encrypted - ~?0?2??↑*U??>▲????⌂?↑☻??W⌂?yR?

Decrypted Message - This is a confidential message.

5. Program to implement BlowFish algorithm logic
AIM: Write a C/JAVA program to implement the BlowFish algorithm logic.
PROGRAM:

import [Link];

import [Link].Base64;

import [Link];

public class BlowfishDemo {

public String encrypt(String msg, String key) throws

NoSuchAlgorithmException, NoSuchPaddingException,

InvalidKeyException, IllegalBlockSizeException,

BadPaddingException, UnsupportedEncodingException {

byte[] KeyData = [Link]();

SecretKeySpec KS = new SecretKeySpec(KeyData, "Blowfish");

Cipher cipher = [Link]("Blowfish");

[Link](Cipher.ENCRYPT_MODE, KS);

String encryptedtext = [Link]().

encodeToString([Link]([Link]("UTF-8")));

return encryptedtext;

public String decrypt(String encryptedtext, String key)

throws NoSuchAlgorithmException, NoSuchPaddingException,

InvalidKeyException, IllegalBlockSizeException,
BadPaddingException {

byte[] KeyData = [Link]();

SecretKeySpec KS = new SecretKeySpec(KeyData, "Blowfish");

byte[] ecryptedtexttobytes = [Link]().

decode(encryptedtext);

Cipher cipher = [Link]("Blowfish");

[Link](Cipher.DECRYPT_MODE, KS);

byte[] decrypted = [Link](ecryptedtexttobytes);

String decryptedString =

new String(decrypted, [Link]("UTF-8"));

return decryptedString;

public static void main(String[] args) throws Exception {

final String msg = "Nirula";

final String key = "depart369";

[Link]("Message: " + msg);

BlowfishDemo obj = new BlowfishDemo();

String enc_output = [Link](msg, key);

[Link]("Encrypted text: " + enc_output);

String dec_output = [Link](enc_output, key);

[Link]("Decrypted text: " + dec_output);

OUTPUT

Message: Nirula

Encrypted text: fSbFKHA3Zn8=

Decrypted text: Nirula

6. Program to implement Rijndael algorithm logic
AIM: Write a C/JAVA program to implement the Rijndael algorithm logic.
PROGRAM:

import [Link].*;

public class AES

public static String asHex (byte buf[])

StringBuffer strbuf = new StringBuffer([Link] *2);

int i;

for (i = 0; i < [Link]; i++)

if (((int) buf[i] & 0xff) < 0x10)

[Link]("0");

[Link]([Link]((int) buf[i] & 0xff, 16));

return [Link]();

public static void main(String[] args) throws Exception

String message="AES still rocks!!";

// Get the KeyGenerator

KeyGenerator kgen = [Link]("AES");

[Link](128); // 192 and 256 bits may not be available

// Generate the secret key specs.

SecretKey skey = [Link]();

byte[] raw = [Link]();

SecretKeySpec skeySpec = new SecretKeySpec(raw, "AES");

// Instantiate the cipher

Cipher cipher = [Link]("AES");

[Link](Cipher.ENCRYPT_MODE, skeySpec);

byte[] encrypted = [Link](([Link] == 0 ? message :args[0]).getBytes());

[Link]("encrypted string: " +asHex(encrypted));

[Link](Cipher.DECRYPT_MODE,skeySpec);

byte[] original = [Link](encrypted);

String originalString = new String(original);

[Link]("Original string: " + originalString + " ");

}
}

OUTPUT:

encrypted string: 9a202b58ce463004fcce14b3791bab257fca7bcb928d28fa56a83b9414ffeb20

Original string: AES still rocks!!

7. Encrypt a string using BlowFish algorithm
AIM: Using Java Cryptography, encrypt the text “Hello world” using BlowFish.
Create your own key using Java keytool.

Program:

import [Link];

public class BlowFishCipher

public static void main(String[] args) throws Exception

// create a key generator based upon the Blowfish cipher

KeyGenerator keygenerator = [Link]("Blowfish");

// create a key

SecretKey secretkey = [Link]();

// create a cipher based upon Blowfish

Cipher cipher = [Link]("Blowfish");

// initialise cipher to with secret key

[Link](Cipher.ENCRYPT_MODE, secretkey);

// get the text to encrypt

String inputText = [Link]("Input your message:");

// encrypt message

byte[] encrypted = [Link]([Link]());

// re-initialise the cipher to be in decrypt mode

[Link](Cipher.DECRYPT_MODE, secretkey);

// decrypt message

byte[] decrypted = [Link](encrypted);

// and display the results

[Link]([Link](),"\nEncrypted text: " + new

String(encrypted) + "\n" + "\nDecrypted text: " + new String(decrypted));
[Link](0);

OUTPUT:

Input your message: Hello world

Encrypted text: 3ooo&&(*&*4r4
Decrypted text: Hello world

8. RSA Algorithm
AIM: Write a Java program to implement RSA Algoithm.
PROGRAM:

import [Link].*;

class RSA

public static void main(String args[])

Scanner sc=new Scanner([Link]);

int p,q,n,z,d=0,e,i;

[Link]("Enter the number to be encrypted and decrypted");

int msg=[Link]();

double c;

BigInteger msgback;

[Link]("Enter 1st prime number p");

p=[Link]();

[Link]("Enter 2nd prime number q");

q=[Link]();

n=p*q;

z=(p-1)*(q-1);

[Link]("the value of z = "+z);

for(e=2;e<z;e++)

if(gcd(e,z)==1) // e is for public key exponent

break;

[Link]("the value of e = "+e);

for(i=0;i<=9;i++)

int x=1+(i*z);

if(x%e==0) //d is for private key exponent

d=x/e;

break;

[Link]("the value of d = "+d);

c=([Link](msg,e))%n;

[Link]("Encrypted message is : -");

[Link](c);

//converting int value of n to BigInteger

BigInteger N = [Link](n);

//converting float value of c to BigInteger

BigInteger C = [Link](c).toBigInteger();

msgback = ([Link](d)).mod(N);

[Link]("Derypted message is : -");

[Link](msgback);
}

static int gcd(int e, int z)

if(e==0)

return z;

else

return gcd(z%e,e);

OUTPUT:

Enter the number to be encrypted and decrypted

Enter 1st prime number p

Enter 2nd prime number q

the value of z = 120

the value of e = 7

the value of d = 103

Encrypted message is : -

85.0

Derypted message is : -

6
9. Diffie-Hellman
AIM: Implement the Diffie-Hellman Key Exchange mechanism. Consider the end user as one of
the parties (Alice) and the other party (bob).

PROGRAM:

import [Link].*;

// create class DiffieHellmanAlgorithmExample to calculate the key for two persons

class DiffieHellmanAlgorithmExample {

public static void main(String[] args)

long P, G, x, a, y, b, ka, kb;

// create Scanner class object to take input from user

Scanner sc = new Scanner([Link]);

[Link]("Both the users should be agreed upon the public keys G and P");

// take inputs for public keys from the user

[Link]("Enter value for public key G:");

G = [Link]();

[Link]("Enter value for public key P:");

P = [Link]();

[Link]("Enter value for private key a selected by user1 X:");

a = [Link]();

[Link]("Enter value for private key b selected by user2 Y:");

b = [Link]();

x = calculatePower(G, a, P);

y = calculatePower(G, b, P);

ka = calculatePower(y, a, P);

kb = calculatePower(x, b, P);

// print secret keys of user1 and user2

[Link]("Secret key for User1 is:" + ka);

[Link]("Secret key for User2 is:" + kb);

}
// create calculatePower() method to find the value of x ^ y mod P

private static long calculatePower(long x, long y, long P)

long result = 0;

if (y == 1){

return x;

else{

result = ((long)[Link](x, y)) % P;

return result;

OUTPUT

Both the users should be agreed upon the public keys G and P

Enter value for public key G: 7

Enter value for public key P: 23

Enter value for private key a selected by user1 X: 3

Enter value for private key b selected by user2 Y: 6

Secret key for User1 is:18

Secret key for User2 is:18

10. SHA-1
AIM: Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
PROGRAM:

import [Link];

public class SHAONE {

public static String encryptThisString(String input)

{

try {

// getInstance() method is called with algorithm SHA-1

MessageDigest md = [Link]("SHA-1");

// digest() method is called

// to calculate message digest of the input string

// returned as array of byte

byte[] messageDigest = [Link]([Link]());

// Convert byte array into signum representation

BigInteger no = new BigInteger(1, messageDigest);

// Convert message digest into hex value

String hashtext = [Link](16);

// Add preceding 0s to make it 32 bit

while ([Link]() < 32) {

hashtext = "0" + hashtext;

// return the HashText

return hashtext;

// For specifying wrong message digest algorithms

catch (NoSuchAlgorithmException e) {

throw new RuntimeException(e);

// Driver code
public static void main(String args[]) throws
NoSuchAlgorithmException

[Link]("HashCode Generated by SHA-1 for: ");

String s1 = "Nirul";

[Link]("\n" + s1 + " : " + encryptThisString(s1));

String s2 = "abcdefghijklmnopqrstuvwxyz";

[Link]("\n" + s2 + " : " + encryptThisString(s2));

OUTPUT:

HashCode Generated by SHA-1 for:

Nirula : 6b205d4a49b77372135846f6425b18f1a3b29a25

abcdefghijklmnopqrstuvwxyz : 32d10c7b8cf96570ca04ce37f2a19d84240d3a89

11. Message Digest Algorithm5 (MD5)

AIM: Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
PROGRAM:

import [Link];

// Java program to calculate MD5 hash value

public class MD5 {

public static String getMd5(String input)

try {

// Static getInstance method is called with hashing MD5

MessageDigest md = [Link]("MD5");
// digest() method is called to calculate message digest

// of an input digest() return array of byte

byte[] messageDigest = [Link]([Link]());

// Convert byte array into signum representation

BigInteger no = new BigInteger(1, messageDigest);

// Convert message digest into hex value

String hashtext = [Link](16);

while ([Link]() < 32) {

hashtext = "0" + hashtext;

return hashtext;

// For specifying wrong message digest algorithms

catch (NoSuchAlgorithmException e) {

throw new RuntimeException(e);

// Driver code

public static void main(String args[]) throws NoSuchAlgorithmException

String s = "Nirula Today";

[Link]("Your HashCode Generated by MD5 is: " + getMd5(s));

OUTPUT:

Your HashCode Generated by MD5 is: 355ffa6ba8d2aa1102d1db8aa2cc748c

Common questions