用的是文件输入输出明文密文，进行了测试。
Using a file input and output ciphertext expressly to carry out the test.
接着，接收应用程序一接收到消息就对其解密，将它从密文转换回明文。
The receiving application then decrypts the message upon receipt, converting from ciphertext back to plain text.
密钥：密钥是一种在明文与密文之间相互转换的方式。
Key: Key is a means of converting a plain-text into cipher-text and vice versa.
如果有完整的明文和对应的密文可是实现破译功能，即得出加密密钥。
If there is an express integrity and the corresponding ciphertext But achieving deciphering function, which is derived encryption keys.
下面是有关明文、密文和密钥关系的表示法。
The following is a notation for relating plaintext, ciphertext, and keys.
分析表明，该文所设计的加密算法不但能抵抗唯密文攻击，而且能有效地抵抗选择明文攻击。
The analysis indicates that the encryption algorithm not only can effectively resist cipher-text-only attack but also chosen-plaintext attack.
同时对这种加密算法的明文密码空间、密文密码空间和加密强度等作了初步的分析。
Therefore the decryption time and difficulty can be greatly increased, and the cipher can be protected from decryption in this algorithm.
同时对这种加密算法的明文密码空间、密文密码空间和加密强度等作了初步的分析。
The paper also tentatively discusses several related encryption algorithms to improve the security and analyzes the plaintext key space, ciphertext key space and encryption strength.
通过使用动态密码对明文的修补，使其密文长度与明文长度相等。
The ameliorated algorithm ensures the length of cipher text is equal to the length of plain text by patching it with dynamic cipher.
提出一种基于混沌迭代的加密算法，这种加密算法根据混沌迭代确定的位置将明文填入一个较大的密文空间。
The plain text is filled into a larger cipher text space according to the position determined by the chaotic iteration.
这些加密都可以对输入数据量很大并且长度可变的明文进行加密，但是只有在明文的前 个分组处理完毕后才输出密文的第 个分组。
Three are ciphers that can take input plaintexts of large and varying lengths and will output the ith block of the ciphertext after having processed only the first i blocks of the plaintext.
相对公钥密码算法，接收方可以在不知道明文的情况下，直接对密文执行融合，节省了因解密带来的能量消耗。
Corresponding to public key cryptographic algorithm, it can save energy consumption because the receiver can aggregate cryptograph directly instead of obtaining explicit terms.
结果表明，该方法在穷举量约为241时，能恢复出输入输出变换的子密钥信息以及密文对应的明文信息。
Result shows that this method can obtain the sub-keys and the corresponding plaintexts when the computing complexity of the improving attack is about 241.
结果表明，该方法在穷举量约为241时，能恢复出输入输出变换的子密钥信息以及密文对应的明文信息。
Result shows that this method can obtain the sub-keys and the corresponding plaintexts when the computing complexity of the improving attack is about 241.
应用推荐