Location:
Search - Vigenre
Search list
Description: 实现Vigenre密码加密算法,没有采用查表的方式来实现,同过采用直接计算的方式来实现,速度快,耗内存小-achieve Vigenre password encryption algorithm, without the use of the look-up table method to achieve. Guo with the direct calculation method to achieve speed and small memory consumption
Platform: |
Size: 930 |
Author: 潘宣辰 |
Hits:
Description: Tasks
Read the textbook about the details of Vigenére Cipher.
Implement the algorithm by C or C++.
Requirements
You do this lab in a group of two students.
Your program should have input and output as follows:
csci>a.out
--> Please input the key:
receptive
--> Please input the plain text:
wearediscoveredsaveyourself
--> The cipher text is :
nicvtwqngfzgvtwavzvcqyglmgj
-->The original message is:
wearediscoveredsaveyourself
• You should test your program with several runs.
Platform: |
Size: 8783 |
Author: wyxm |
Hits:
Description: Vigenère密码小程序 没有解密的过程 仅供学习
Platform: |
Size: 1178 |
Author: 张没 |
Hits:
Description: Vigenre方阵!能打印出Vigenre方阵图,还能实现用该图进行加密-A Vigenre phalanx! It can print out Vigenre phalnx pictures and use the pictures to encrpt.
Platform: |
Size: 28796 |
Author: 马愉兴 |
Hits:
Description: Vigenre方阵!能打印出Vigenre方阵图,还能实现用该图进行加密-A Vigenre phalanx! It can print out Vigenre phalnx pictures and use the pictures to encrpt.
Platform: |
Size: 28672 |
Author: 马愉兴 |
Hits:
Description: 实现Vigenre密码加密算法,没有采用查表的方式来实现,同过采用直接计算的方式来实现,速度快,耗内存小-achieve Vigenre password encryption algorithm, without the use of the look-up table method to achieve. Guo with the direct calculation method to achieve speed and small memory consumption
Platform: |
Size: 1024 |
Author: 潘宣辰 |
Hits:
Description: Tasks
Read the textbook about the details of Vigenére Cipher.
Implement the algorithm by C or C++.
Requirements
You do this lab in a group of two students.
Your program should have input and output as follows:
csci>a.out
--> Please input the key:
receptive
--> Please input the plain text:
wearediscoveredsaveyourself
--> The cipher text is :
nicvtwqngfzgvtwavzvcqyglmgj
-->The original message is:
wearediscoveredsaveyourself
• You should test your program with several runs.
-TasksRead the textbook about the details of Vigenére Cipher.Implement the algorithm by C or C++. RequirementsYou do this lab in a group of two students.Your program should have input and output as follows: csci> a.out--> Please input the key: receptive-> Please input the plain text: wearediscoveredsaveyourself-> The cipher text is: nicvtwqngfzgvtwavzvcqyglmgj-> The original message is: wearediscoveredsaveyourself
Platform: |
Size: 8192 |
Author: wyxm |
Hits:
Description: Vigenère密码小程序 没有解密的过程 仅供学习-Applet Vigenère password decryption process is not only learning
Platform: |
Size: 1024 |
Author: 张没 |
Hits:
Description: 维吉尼亚算法的实现，构成
明文：每个字符惟一对应一个0~25间的数字。
密钥：一个字符串，其中每个字符同明文一样对应一个数字，代表位移值，如a 表示位移 0，b 表示位移 1，c 表示位移 2，...... ）。
加密过程：
将明文数字串依据密钥长度分段，并逐一与密钥数字串相加（模26），得到密文数字串；
最后，将密文数字串转换为字母串。
-Virginia algorithm constitutes explicit: Each character corresponds to only a 0 ~ 25 figures. Key: a string, each of which express the same character with a corresponding figures represent the displacement values, such as a, said the displacement 0, b said displacement 1, c that the displacement of 2 ,......). Encryption process: to express the number of sub-series based on key length, and one by one with the string of key figures add up (modulus 26), has been the number of string ciphertext Finally, the figures ciphertext string converted to string letters.
Platform: |
Size: 2048 |
Author: rock |
Hits:
Description: Vigenre加密算法，在VC++环境中运行！-Vigenre encryption algorithm in VC++ environment to run!
Platform: |
Size: 1024 |
Author: ang |
Hits:
Description: vigenre 是关于加密的java实现-vigenre java password
Platform: |
Size: 1024 |
Author: ydm |
Hits:
Description: c语言环境下维吉尼亚密码的加密和解密源代码，简单易懂- encryption and decryption of Virginia algorithm encryption and decryption
Platform: |
Size: 1024 |
Author: jane |
Hits:
Description: Vigenère解密实现，区分明文大小写，密钥重用-Vigenre password achieve, is case sensitive, key reuse
Platform: |
Size: 4096 |
Author: wen |
Hits:
Description: A polyalphabetic cipher is any cipher based on substitution, using multiple substitution alphabets. The Vigenère cipher is probably the best-known example of a polyalphabetic cipher, though it is a simplified special case.Polyalphabetic substitution ciphers are useful because the are less easily broken by frequency analysis, however if an attacker knows for instance that the message has a period n, then he simply can individually frequency analyze each cipher alphabet.
The number of letters encrypted before a polyalphabetic substitution cipher returns to its first cipher alphabet is called its period. The larger the period, the stronger the cipher. Of course, this method of encryption is certainly not secure by any definition and should not be applied to any real-life scenarios.
Platform: |
Size: 9216 |
Author: mathi |
Hits:
Description: The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.Though the cipher is easy to understand and implement, for three centuries it resisted all attempts to break it this earned it the description le chiffre indéchiffrable (French for the indecipherable cipher ). Many people have tried to implement encryption schemes that are essentially Vigenère ciphers.[3] Friedrich Kasiski was the first to publish a general method of deciphering a Vigenère cipher.Unlike the monoalphabetic ciphers, polyalphabetic ciphers are not susceptible to frequency analysis, as more than one letter in the plaintext can be represented by a single letter in the encryption.-The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.Though the cipher is easy to understand and implement, for three centuries it resisted all attempts to break it this earned it the description le chiffre indéchiffrable (French for the indecipherable cipher ). Many people have tried to implement encryption schemes that are essentially Vigenère ciphers.[3] Friedrich Kasiski was the first to publish a general method of deciphering a Vigenère cipher.Unlike the monoalphabetic ciphers, polyalphabetic ciphers are not susceptible to frequency analysis, as more than one letter in the plaintext can be represented by a single letter in the encryption.
Platform: |
Size: 10240 |
Author: mathi |
Hits:
Description: The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. It is a simple form of polyalphabetic substitution.
Platform: |
Size: 331776 |
Author: Erick |
Hits:
Description: The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword.
Platform: |
Size: 169984 |
Author: Knecht |
Hits:
Description: cipher
Encrypt by using cipher
Platform: |
Size: 15360 |
Author: mohammed |
Hits: