Scribd
Upload
42 views3 pages

PR2 - Caesar Cipher - OK

Uploaded by

Prafulla Durgadhar Gawande
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
42 views3 pages

PR2 - Caesar Cipher - OK

Uploaded by

Prafulla Durgadhar Gawande
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Sipna College of Engineering & Technology, Amravati.

Department of Electronics and Telecommunication Engineering

Department: - Electronics & Telecommunication Class: - IV yr


Subject: - CRYPTOGRAPHY AND NETWORK SECURITY Sem: - VII
Manual

PRACTICAL NO.2

Aim: Write a program to encrypt the data using Caesar cipher.

Software Required: Turbo C/C++, OR gcc compiler.

THEORY:
The Caesar Cipher technique is one of the earliest and simplest method of encryption
technique. It’s simply a type of substitution cipher, i.e., each letter of a given text is replaced by a letter
some fixed number of positions down the alphabet. For example with a shift of 1, A would be replaced by
B, B would become C, and so on. The method is apparently named after Julius Caesar, who apparently
used it to communicate with his officials. Thus to cipher a given text we need an integer value, known as
shift which indicates the number of position each letter of the text has been moved down.  
The encryption can be represented using modular arithmetic by first transforming the letters into numbers,
according to the scheme, A = 0, B = 1,…, Z = 25. Encryption of a letter  by a shift n can be described
mathematically  
 
(Encryption Phase with shift n)
(Decryption Phase with shift n)

E &TC/SEM-VII/C&NS/PR02 Page 1
Sipna College of Engineering & Technology, Amravati.
Department of Electronics and Telecommunication Engineering

Examples : 

Text : ABCDEFGHIJKLMNOPQRSTUVWXYZ
Shift: 23
Cipher: XYZABCDEFGHIJKLMNOPQRSTUVW

Text : ATTACKATONCE
Shift: 4
Cipher: EXXEGOEXSRGI

Algorithm for Caesar Cipher:  

Input: 
 
1. A String of lower case letters, called Text.
2. An Integer between 0-25 denoting the required shift.

Procedure: 
 
 Traverse the given text one character at a time.
 For each character, transform the given character as per the rule, depending on whether we’re
encrypting or decrypting the text.
 Return the new string generated.

Program :

// A C++ program to illustrate Caesar Cipher Technique

#include <iostream>

using namespace std;

 // This function receives text and shift and

// returns the encrypted text

string encrypt(string text, int s)


{
    string result = "";    // traverse text
    for (int i=0;i<text.length();i++)
    {
        // apply transformation to each character

        // Encrypt Uppercase letters

E &TC/SEM-VII/C&NS/PR02 Page 2
Sipna College of Engineering & Technology, Amravati.
Department of Electronics and Telecommunication Engineering

        if (isupper(text[i]))

            result += char(int(text[i]+s-65)%26 +65); 

    else

        result += char(int(text[i]+s-97)%26 +97);


    }
     // Return the resulting string

    return result;

}
 // Driver program to test the above function

int main()
{
    string text="ATTACKATONCE";

    int s = 4;

    cout << "Text : " << text;

    cout << "\nShift: " << s;

    cout << "\nCipher: " << encrypt(text, s);

    return 0;

Output: 
 
Text : ATTACKATONCE
Shift: 4
Cipher: EXXEGOEXSRGI

Conclusion: Thus we have implemented encryption algorithm of Caesar cipher.

E &TC/SEM-VII/C&NS/PR02 Page 3

You might also like