Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Ins 3

    Uploaded by

    Raghav Punjani
    The document describes an implementation of the Playfair cipher for encryption and decryption of text. The Playfair cipher works by encrypting pairs of letters (digraphs) based on their positions in a 5x5 grid generated from a keyword. The code provided generates the key table from the keyword, searches the table to encrypt/decrypt each digraph, and includes a main function to test the encryption and decryption.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Ins 3

    Uploaded by

    Raghav Punjani
    27 views8 pages
    The document describes an implementation of the Playfair cipher for encryption and decryption of text. The Playfair cipher works by encrypting pairs of letters (digraphs) based on their positions in a 5x5 grid generated from a keyword. The code provided generates the key table from the keyword, searches the table to encrypt/decrypt each digraph, and includes a main function to test the encryption and decryption.

    Original Title

    ins-3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an implementation of the Playfair cipher for encryption and decryption of text. The Playfair cipher works by encrypting pairs of letters (digraphs) based on their positions in a 5x5 grid generated from a keyword. The code provided generates the key table from the keyword, searches the table to encrypt/decrypt each digraph, and includes a main function to test the encryption and decryption.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views8 pages

    Ins 3

    Uploaded by

    Raghav Punjani
    The document describes an implementation of the Playfair cipher for encryption and decryption of text. The Playfair cipher works by encrypting pairs of letters (digraphs) based on their positions in a 5x5 grid generated from a keyword. The code provided generates the key table from the keyword, searches the table to encrypt/decrypt each digraph, and includes a main function to test the encryption and decryption.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 8

    PROGRAM - 3

    Aim :​ To implement Playfair Cipher Encryption-Decryption

    Introduction:​ ​The Playfair cipher was the first practical digraph substitution cipher. The
    scheme was invented in 1854 by Charles Wheatstone but was named after Lord Playfair
    who promoted the use of the cipher. In playfair cipher unlike ​traditional cipher, we​ encrypt a
    pair of alphabets(digraphs) instead of a single alphabet. It employs a table where one letter
    of the alphabet is omitted, and the letters are arranged in a 5x5 grid. Typically, the J is
    removed from the alphabet and an I takes its place in the text that is to be encoded.

    Code:

    Encryption:
    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>

    #define SIZE 30

    void toLowerCase(char plain[], int ps)


    {
    int i;
    for (i = 0; i < ps; i++) {
    if (plain[i] > 64 && plain[i] < 91)
    plain[i] += 32;
    }
    }

    int removeSpaces(char* plain, int ps)


    {
    int i, count = 0;
    for (i = 0; i < ps; i++)
    if (plain[i] != ' ')
    plain[count++] = plain[i];
    plain[count] = '\0';
    return count;
    }

    void generateKeyTable(char key[], int ks, char keyT[5][5])


    {
    int i, j, k, flag = 0, *dicty;
    dicty = (int*)calloc(26, sizeof(int));
    for (i = 0; i < ks; i++) {
    if (key[i] != 'j')
    dicty[key[i] - 97] = 2;
    }

    dicty['j' - 97] = 1;

    i = 0;
    j = 0;

    for (k = 0; k < ks; k++) {


    if (dicty[key[k] - 97] == 2) {
    dicty[key[k] - 97] -= 1;
    keyT[i][j] = key[k];
    j++;
    if (j == 5) {
    i++;
    j = 0;
    }
    }
    }

    for (k = 0; k < 26; k++) {


    if (dicty[k] == 0) {
    keyT[i][j] = (char)(k + 97);
    j++;
    if (j == 5) {
    i++;
    j = 0;
    }
    }
    }
    }

    void search(char keyT[5][5], char a, char b, int arr[])


    {
    int i, j;

    if (a == 'j')
    a = 'i';
    else if (b == 'j')
    b = 'i';

    for (i = 0; i < 5; i++) {


    for (j = 0; j < 5; j++) {

    if (keyT[i][j] == a) {
    arr[0] = i;
    arr[1] = j;
    }
    else if (keyT[i][j] == b) {
    arr[2] = i;
    arr[3] = j;
    }
    }
    }
    }

    int mod5(int a)
    {
    return (a % 5);
    }

    int prepare(char str[], int ptrs)


    {
    if (ptrs % 2 != 0) {
    str[ptrs++] = 'z';
    str[ptrs] = '\0';
    }
    return ptrs;
    }

    void encrypt(char str[], char keyT[5][5], int ps)


    {
    int i, a[4];

    for (i = 0; i < ps; i += 2) {

    search(keyT, str[i], str[i + 1], a);

    if (a[0] == a[2]) {
    str[i] = keyT[a[0]][mod5(a[1] + 1)];
    str[i + 1] = keyT[a[0]][mod5(a[3] + 1)];
    }
    else if (a[1] == a[3]) {
    str[i] = keyT[mod5(a[0] + 1)][a[1]];
    str[i + 1] = keyT[mod5(a[2] + 1)][a[1]];
    }
    else {
    str[i] = keyT[a[0]][a[3]];
    str[i + 1] = keyT[a[2]][a[1]];
    }
    }
    }

    void encryptByPlayfairCipher(char str[], char key[])


    {
    char ps, ks, keyT[5][5];

    ks = strlen(key);
    ks = removeSpaces(key, ks);
    toLowerCase(key, ks);

    ps = strlen(str);
    toLowerCase(str, ps);
    ps = removeSpaces(str, ps);

    ps = prepare(str, ps);

    generateKeyTable(key, ks, keyT);

    encrypt(str, keyT, ps);


    }

    int main()
    {
    char str[SIZE], key[SIZE];

    strcpy(key, "Monarchy");
    printf("Key text: %s\n", key);

    strcpy(str, "instruments");
    printf("Plain text: %s\n", str);

    encryptByPlayfairCipher(str, key);

    printf("Cipher text: %s\n", str);

    return 0;
    }
    Decryption:

    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    #define SIZE 30

    void toLowerCase(char plain[], int ps)


    {
    int i;
    for (i = 0; i < ps; i++) {
    if (plain[i] > 64 && plain[i] < 91)
    plain[i] += 32;
    }
    }

    int removeSpaces(char* plain, int ps)


    {
    int i, count = 0;
    for (i = 0; i < ps; i++)
    if (plain[i] != ' ')
    plain[count++] = plain[i];
    plain[count] = '\0';
    return count;
    }

    void generateKeyTable(char key[], int ks,


    char keyT[5][5])
    {
    int i, j, k, flag = 0, *dicty;

    dicty = (int*)calloc(26, sizeof(int));

    for (i = 0; i < ks; i++) {


    if (key[i] != 'j')
    dicty[key[i] - 97] = 2;
    }
    dicty['j' - 97] = 1;

    i = 0;
    j = 0;
    for (k = 0; k < ks; k++) {
    if (dicty[key[k] - 97] == 2) {
    dicty[key[k] - 97] -= 1;
    keyT[i][j] = key[k];
    j++;
    if (j == 5) {
    i++;
    j = 0;
    }
    }
    }
    for (k = 0; k < 26; k++) {
    if (dicty[k] == 0) {
    keyT[i][j] = (char)(k + 97);
    j++;
    if (j == 5) {
    i++;
    j = 0;
    }
    }
    }
    }

    void search(char keyT[5][5], char a,


    char b, int arr[])
    {
    int i, j;

    if (a == 'j')
    a = 'i';
    else if (b == 'j')
    b = 'i';

    for (i = 0; i < 5; i++) {


    for (j = 0; j < 5; j++) {
    if (keyT[i][j] == a) {
    arr[0] = i;
    arr[1] = j;
    }
    else if (keyT[i][j] == b) {
    arr[2] = i;
    arr[3] = j;
    }
    }
    }
    }

    int mod5(int a)
    {
    return (a % 5);
    }

    void decrypt(char str[], char keyT[5][5], int ps)


    {
    int i, a[4];
    for (i = 0; i < ps; i += 2) {
    search(keyT, str[i], str[i + 1], a);
    if (a[0] == a[2]) {
    str[i] = keyT[a[0]][mod5(a[1] - 1)];
    str[i + 1] = keyT[a[0]][mod5(a[3] - 1)];
    }
    else if (a[1] == a[3]) {
    str[i] = keyT[mod5(a[0] - 1)][a[1]];
    str[i + 1] = keyT[mod5(a[2] - 1)][a[1]];
    }
    else {
    str[i] = keyT[a[0]][a[3]];
    str[i + 1] = keyT[a[2]][a[1]];
    }
    }
    }

    void decryptByPlayfairCipher(char str[], char key[])


    {
    char ps, ks, keyT[5][5];

    ks = strlen(key);
    ks = removeSpaces(key, ks);
    toLowerCase(key, ks);

    ps = strlen(str);
    toLowerCase(str, ps);
    ps = removeSpaces(str, ps);

    generateKeyTable(key, ks, keyT);

    decrypt(str, keyT, ps);


    }

    int main()
    {
    char str[SIZE], key[SIZE];

    strcpy(key, "Monarchy");
    printf("Key text: %s\n", key);
    strcpy(str, "gatlmzclrqtx");
    printf("Plain text: %s\n", str);

    decryptByPlayfairCipher(str, key);

    printf("Deciphered text: %s\n", str);

    return 0;
    }

    Output:

    Encryption:

    Decryption:

    Finding and Learning :


    Playfair is reasonably fast to use and requires no special equipment.In playfair 
    cipher unlike ​traditional cipher​ we encrypt a pair of alphabets(digraphs) instead of a 
    single alphabet.

    You might also like