拉丁字母密码加密技术是最早和最简单的数据加密技术之一。这只是一种替换密码技术，即给定文本的每个字母都被其对应的数字替换，如字母顺序所示。例如，我们给了一个字符串“hello everyone”，那么它的拉丁密码加密将是“85112515522551415”。
null
![图片[1]-拉丁字母密码-yiteyi-C++库](https://www.yiteyi.com/wp-content/uploads/geeks/geeks_IMAGE-300x67.png)
例如：
Input : geeksforgeeksOutput : Encrypted Code using Latin Alphabet 7 5 5 11 19 6 15 18 7 5 5 11 19 Input : hello everyoneOutput : Encrypted Code using Latin Alphabet 8 5 12 12 15 5 22 5 18 25 15 14 5
先决条件： C/C++中的isalpha（）和isdigit（）函数及其示例 下面是将给定字符串转换为拉丁字母密码的程序：
C++
// Latin Alphabet Cipher Encryption header files #include <bits/stdc++.h> // function for calculating the encryption void cipher( char str[]) { for ( int i = 0; str[i] != ' ' ; i++) { if ( isalpha (str[i]) == 0 && str[i] != ' ' ) { printf ( "Enter only alphabets and space" ); return ; } } printf ( "Encrypted Code using Latin Alphabet" ); for ( int i = 0; str[i] != ' ' ; 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 ( "" ); } // driver code int main() { char str[] = "geeksforgeeks" ; cipher(str); return 0; } |
JAVA
// Java program to demonstrate // Latin Alphabet Cipher class LatinCipher { // function for calculating the encryption 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(); } // Driver Code public static void main(String[] args) { String str = "geeksforgeeks" ; cipher(str); } } // This code is contributed by Vivekkumar Singh |
Python3
# Python program to demonstrate # Latin Alphabet Cipher # function for calculating the encryption 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 () # Driver Code if __name__ = = "__main__" : str = "geeksforgeeks" cipher( str ) # This code is contributed by # sanjeev2552 |
C#
// C# program to demonstrate // Latin Alphabet Cipher using System; public class LatinCipher { // function for calculating the encryption 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(); } // Driver Code public static void Main(String[] args) { String str = "geeksforgeeks" ; cipher(str); } } // This code has been contributed by 29AjayKumar |
PHP
<?php // Latin Alphabet Cipher // Encryption header files // function for calculating // the encryption function cipher( $str ) { if (!ctype_alpha( $str )) { printf( "Enter only " + "alphabets and space" ); return ; } printf( "Encrypted Code using " ); printf( "Latin Alphabet" ); 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 "" ; } // Driver Code $str = "geeksforgeeks" ; cipher( $str ); // This code is contributed by mits. ?> |
Javascript
<script> // JavaScript program to demonstrate // Latin Alphabet Cipher // function for calculating the encryption 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>" ); } //check isLetter function isLetter(str) { return str.length === 1 && str.match(/[a-z]/i); } // Driver Code var str = "geeksforgeeks" ; cipher(str); </script> |
输出：
Encrypted Code using Latin Alphabet7 5 5 11 19 6 15 18 7 5 5 11 19
© 版权声明
文章版权归作者所有，未经允许请勿转载。
THE END
![关于”PostgreSQL错误：关系[表]不存在“问题的原因和解决方案-yiteyi-C++库](https://www.yiteyi.com/wp-content/themes/zibll/img/thumbnail.svg)
