Latin alphabet cipher
Last Updated :
22 Nov, 2022
The Latin Alphabet Cipher Encryption Technique is one of the earliest and simplest techniques of encrypting data. It’s simply a type of substitution cipher technique, i.e., each letter of a given text is substituted by its corresponding number as represented in its alphabetical order. For Example, we have given a string as “hello everyone”, then its Latin Cipher Encryption will be “8 5 12 12 15 5 22 5 18 25 15 14 5”.
Examples:
Input : geeksforgeeks
Output : Encrypted Code using Latin Alphabet
7 5 5 11 19 6 15 18 7 5 5 11 19
Input : hello everyone
Output : Encrypted Code using Latin Alphabet
8 5 12 12 15 5 22 5 18 25 15 14 5
Prerequisite : isalpha() and isdigit() functions in C/C++ with example
Below is the program to convert a given string to its Latin Alphabet cipher:
C++
#include <bits/stdc++.h>
void cipher( char str[])
{
for ( int i = 0; str[i] != '\0' ; i++) {
if ( isalpha (str[i]) == 0 && str[i] != ' ' ) {
printf ( "Enter only alphabets and space\n" );
return ;
}
}
printf ( "Encrypted Code using Latin Alphabet\n" );
for ( int i = 0; str[i] != '\0' ; i++) {
if (str[i] >= 'A' && str[i] <= 'Z' )
printf ( "%d " , str[i] - 'A' + 1);
else if (str[i] >= 'a' && str[i] <= 'z' )
printf ( "%d " , str[i] - 'a' + 1);
if (str[i] == ' ' )
printf ( "%c" , str[i]);
}
printf ( "\n" );
}
int main()
{
char str[] = "geeksforgeeks" ;
cipher(str);
return 0;
}
|
Java
class LatinCipher
{
static void cipher(String str)
{
for ( int i = 0 ; i < str.length(); i++)
{
if (!Character.isLetter(str.charAt(i)) &&
str.charAt(i) != ' ' )
{
System.out.println( "Enter only alphabets and space" );
return ;
}
}
System.out.println( "Encrypted Code using Latin Alphabet" );
for ( int i = 0 ; i < str.length(); i++)
{
if (str.charAt(i) >= 'A' && str.charAt(i) <= 'Z' )
{
System.out.print(str.charAt(i) - 'A' + 1 + " " );
}
else if (str.charAt(i) >= 'a' && str.charAt(i) <= 'z' )
{
System.out.print(str.charAt(i) - 'a' + 1 + " " );
}
if (str.charAt(i) == ' ' )
System.out.print(str.charAt(i));
}
System.out.println();
}
public static void main(String[] args)
{
String str = "geeksforgeeks" ;
cipher(str);
}
}
|
Python3
def cipher( str ):
for i in range ( len ( str )):
if str [i].isalpha() = = 0 and str [i] ! = " " :
print ( "Enter only alphabets and space" )
return
print ( "Encrypted Code using Latin Alphabet" )
for i in range ( len ( str )):
if str [i] > = "A" and str [i] < = "Z" :
print ( ord ( str [i]) - ord ( "A" ) + 1 , end = " " )
elif str [i] > = "a" and str [i] < = 'z' :
print ( ord ( str [i]) - ord ( "a" ) + 1 , end = " " )
if str [i] = = " " :
print ( str [i])
print ()
if __name__ = = "__main__" :
str = "geeksforgeeks"
cipher( str )
|
C#
using System;
public class LatinCipher
{
static void cipher(String str)
{
for ( int i = 0; i < str.Length; i++)
{
if (! char .IsLetter(str[i]) &&
str[i] != ' ' )
{
Console.WriteLine( "Enter only alphabets and space" );
return ;
}
}
Console.WriteLine( "Encrypted Code using Latin Alphabet" );
for ( int i = 0; i < str.Length; i++)
{
if (str[i] >= 'A' && str[i] <= 'Z' )
{
Console.Write(str[i] - 'A' + 1 + " " );
}
else if (str[i] >= 'a' && str[i] <= 'z' )
{
Console.Write(str[i] - 'a' + 1 + " " );
}
if (str[i] == ' ' )
Console.Write(str[i]);
}
Console.WriteLine();
}
public static void Main(String[] args)
{
String str = "geeksforgeeks" ;
cipher(str);
}
}
|
PHP
<?php
function cipher( $str )
{
if (!ctype_alpha( $str ))
{
printf( "Enter only " +
"alphabets and space\n" );
return ;
}
printf( "Encrypted Code using " );
printf( "Latin Alphabet\n" );
for ( $i = 0; $i < strlen ( $str ); $i ++)
{
if ( $str [ $i ] >= 'A' &&
$str [ $i ] <= 'Z' )
echo (ord( $str [ $i ]) -
65 + 1). " " ;
else if ( $str [ $i ] >= 'a' &&
$str [ $i ] <= 'z' )
echo (ord( $str [ $i ]) -
97 + 1). " " ;
}
echo "\n" ;
}
$str = "geeksforgeeks" ;
cipher( $str );
?>
|
Javascript
<script>
function cipher(str) {
for ( var i = 0; i < str.length; i++) {
if (!isLetter(str[i]) && str[i] !== " " ) {
document.write( "Enter only alphabets and space" );
return ;
}
}
document.write( "Encrypted Code using Latin Alphabet <br>" );
for ( var i = 0; i < str.length; i++) {
if (str[i] >= "A" && str[i] <= "Z" ) {
document.write(str[i].charCodeAt(0)
- "A" .charCodeAt(0) + 1 + "" );
}
else if (str[i] >= "a" && str[i] <= "z" ) {
document.write(str[i].charCodeAt(0)
- "a" .charCodeAt(0) + 1 + " " );
}
if (str[i] == " " )
document.write(str[i]);
}
document.write( "<br>" );
}
function isLetter(str) {
return str.length === 1 && str.match(/[a-z]/i);
}
var str = "geeksforgeeks" ;
cipher(str);
</script>
|
Output
Encrypted Code using Latin Alphabet
7 5 5 11 19 6 15 18 7 5 5 11 19
Time Complexity: O(n), where n is the length of the given string.
Auxiliary Space: O(1), no extra space is required, so it is a constant.
Share your thoughts in the comments
Please Login to comment...