Null Cipher

1.5


A null cipher, also known as concealment cipher, is an ancient form of encryption where the plaintext is mixed with a large amount of non-cipher material. Today it is regarded as a simple form of steganography, which can be used to hide ciphertext.

There are various options of using the Null Cipher. Here we are taking the first letter from each word successively. The pattern can be chosen to increase the cryptography level Other options can be:

  • Taking last letters from each word.
  • Taking the letter from the particular position
  • Using the pattern (1, 2, 3, 1, 2, 3 [each letter in each word]). You can use some other pattern also.
  • Positing of the significant letters next to or at certain intervals from punctuation marks or particular characters.

Null Cipher taking the first letter from each word successively


More Examples of messages containing null ciphers:

Input will be one paragraph or sentence without any newline.

Input : News Eight Weather: Tonight increasing snow.
        Unexpected precipitation smothers eastern
        towns. Be extremely cautious and use snowtires
        especially heading east. The [highway is not]
        knowingly slippery. Highway evacuation is 
        suspected. Police report emergency situations
        in downtown ending near Tuesday.

Explanation:
Taking the first letter in each word successively yields
the real message.
Here we are converting decoded message to lowercase.

News Eight Weather: Tonight Increasing Snow.
Unexpected Precipitation Smothers Eastern
Towns. Be Extremely Cautious And Use Snowtires
Especially Heading East. The [Highway Is Not]
Knowingly Slippery. Highway Evacuation Is
Suspected. Police Report Emergency Situations
In Downtown Ending Near Tuesday.

Output :
After Deciphered : newtisupsetbecausehethinksheispresident

After breaking the words manually the output will be:
  Newt is upset because he thinks he is President

// CPP program to decode NULL CIPHER

#include <bits/stdc++.h>
using namespace std;

// Function to decode the message.
string decode(string str)
{
    // Store the decoded string.
    string res = "";
    // found variable is used to tell that the encoded
    // encoded character is found in that particular word.
    bool found = false;
    
    for (int i = 0; i < str.size(); i++) {
    // Set found variable to false whenever we find
    // whitespace, meaning that encoded character for
    // new word is not found
	if(str[i] == ' ')
	{
	found = false;
	continue;
	}
	if(!found)
	{
	if( str[i] >= 'A' && str[i] <= 'Z')
	{
		res += str[i] + 32;
	found = true;
	}
	else if(str[i] >= 'a' && str[i] <= 'z')
	{
		res += str[i];
	found = true;
	}
	}
}
return res;
}

// Driver code
int main()
{
    string in;
    in = "A Step by Step Guide for Placement Preparation by GeeksforGeeks";
    
    cout << "Enciphered Message: ";
    
    // Function call
    cout << decode(in) << endl;
    return 0;
}

Output:

Enciphered Message: asbsgfppbg

This article is contributed by Sachin Bisht. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.

Recommended Posts:



1.5 Average Difficulty : 1.5/5.0
Based on 4 vote(s)










Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.