MD5-test

汇编加密文件一例。-compilation of case file encryption.

RSA公钥加密，用C实现，大家可以参考一下-RSA public key encryption, using C to achieve, we can refer to

说明：  编制程序，将输入的一行字符以加密的形式输出，然后将其解密，解密的字符串序列与输入的正文相比较，吻合时输出解密的正文，否则解密失败。 加密时，将每个字符的ascii码依次反复加上“4962873”中的数字，并在32（‘’）~122（‘z’）之间作模运算。解密与加密的顺序相反。例如输入正文“the result of 3 and 2 is not 8” 结果为： (Programming, the input line character output in an encrypted form, and then decrypted, the decrypted text sequence of characters compared with the input, output to decrypt the body of the agreement, otherwise the decryption failed. Encryption, ascii code of each character in turn repeatedly with &quot 4962873&quot in the figures, and 32 (' ' )~ 122 (' z' ) as a model between the operations. Decryption and encryption in reverse order. For example, enter the text &quot the result of 3 and 2 is not 8&quot results:)

微狗(UMI/UMC/PMH/PMI)驱动安装程序是安装在 Windows 9X/ME/NT/2K/XP/WS2003/Vista /XP64/WS2003x64/Vista64环境下的驱动的程序。- 微狗(UMI/UMC/PMH/PMI)驱动安装程序是安装在 Windows 9X/ME/NT/2K/XP/WS2003/Vista /XP64/WS2003x64/Vista64环境下的驱动的程序。

可以绘制出常用的混沌图形，描述出混沌的发展趋势与概貌-Can be used to map out the chaotic graphics, described a chaotic development trends and profiles

des数据加密标准算法描述-des data encryption standard algorithm description

DIAMOND加密算法的原代码-separate encryption algorithm source code

2的16次幂正整数d与n，编写计算d-1 (mod n) 的程序； 2、对于三个不超过2的16次幂正整数a、e与n，编写计算ae (mod n) 的程序。 在上述程序基础上写出下列程序： （1） 对给定的10000以内数判定其是否为素数； （2） 进行ElGamal体制的加密与签名。 -two of 16 power-positive integer d and n, calculate the preparation of d-1 (mod n); 2. For not more than 2 3 16 Powers positive integers a, e and n, calculate the preparation ae (mod n) procedures. In the above procedure to write on the basis of the following procedures : (a) the right to 10,000 within a few judging whether a prime number; (2) ElGamal encryption and signature.

来自putty的大数运算代码，纯C实现，移植性好，RSA的最实现-Large numbers from the putty operation code, a pure C implementation, migration is good, RSA best to achieve