chai_en

这个是编译通过的MD5算法，使用的语言是C++，非常好用。(MD5 C++ source code )

MD5加密，已经封装成一个C++类，只要调用该类就可方便使用-This C++ class serves as a wrapper for the Message Digest 5 code described in the Internet RFC 1321.

用于对svn的用户密码进行加密和校验的源程序。可以很方便的生成svn服务器使用的密码格式-Svn used to encrypt the user password and check the source. Can easily generate the svn server password to use format

CRC5循环校验法代码生成，数据校验，数据纠错等功能函数代码-Check Act cycle CRC5 code generation, data checking, data error correction code such as function

在实现AES基础上，用C编写CMAC算法并调试通过。输入数据进行CMAC验证。(In the realization of AES based on the CMAC algorithm written in C and debugging. CMAC input data validation)

A simple cpp program, that receives a file, does a bit-wise "not" for every character, and adds "not" to the extension. Repeated running does the same and removes the "not" from extension. This a "pseudo-encryption", but very useful to avoid automated filtering software. This way it is possible to send "exe" files (or anything else) without the emails being blocked... First - send the source code, have your (enlightened) recipient compile it, then send the "notted" file. The code is not very efficient though, I only had 30 minutes to invest... :)-A simple cpp program, that receives a file, does a bit-wise "not" for every character, and adds "not" to the extension. Repeated running does the same and removes the "not" from extension. This is a "pseudo-encryption", but very useful to avoid automated filtering software. This way it is possible to send "exe" files (or anything else) without the emails being blocked... First - send the source code, have your (enlightened) recipient co

LZW算法基于转换串表(字典)T,将输入字符串映射成定长(通常为12位)的码字-LZW algorithm is based on converting Series (dictionary) T, the input string mapping into fixed-length (usually 12) the code word

Java实现des算法源代码，供大家参考(Java implementation des algorithm)

RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s

xilinx公司三重DES加密代码，内部有用于仿真的文件-xilinx companies Triple DES encryption code used for simulating an internal document