has160哈希函数。用散列的方法将明文处理达到加密的效果。

< 跨度 style="font-size:14.0pt;line-height:115%;font-family：""> weposit，有利安全数据库 leveragingserver-身边值得信赖的硬件可以建一个羽翼丰满，隐私和在 commonserver 硬件上运行成本 （现有或未来） 的任何已启用加密的私人数据处理的一小部分。

md5 算法的纯c版本。方便移植到各种嵌入式小型设备不支持c++的环境-md5 algorithm with pure C version. Easy to transplant it to systems using only C, but not C++

c++写的md5加密算法，易于移植 md5加密-c++ to write the md5 encryption algorithm, easy to transplant md5 encryption

MD5加密算法java实现 * 下面这些S11-S44实际上是一个4*4的矩阵，在原始的C实现中是用#define 实现的， 这里把它们实现成为static final是表示了只读，切能在同一个进程空间内的多个 Instance间共享*/ -MD5 algorithm to achieve java* Below these S11- S44 is a 4* 4 Moment RUF, in a primitive realization of the C# define is achieved, Here they become static final realization of the said CD. cut in the same process space within the shared among many Instance* /

信息学竞赛中常用的算法总结: 串匹配的高效算法-KMP 公开密钥体系之RSA算法 双向广度搜索 图论算法 -Informatics algorithms commonly used race Summary: Efficient String Matching Algorithm-KMP system RSA public key algorithm for bi-directional breadth of the search algorithm of graph theory

use bouncycastle to generate RSA keyPair

java source code for cryptography, including all kinds of classes.-java source code for cryptography, including all kinds of classes.

sspi_workbench

C++实现的椭圆曲线算法。已经写成一个库文件只要调用就行了-C++ Realized elliptic curve algorithm. Has been written in a library file as long as the call on the list

希尔排序算法: 基本思想：将整个无序序列分割成若干小的子序列分别进行插入排序。 序列分割方法：将相隔某个增量h的元素构成一个子序列。在排序过程中，逐次减小这个增量，最后当h减到1时，进行一次插入排序，排序就完成。增量序列一般采用：ht=2t-1,1≤t≤[log2n]，其中n为待排序序列的长度。-Hill sorting algorithm: the basic idea: the whole sequence disorder is separated into a number of small sub-sequences respectively Insertion Sort. Sequence segmentation method: h will be separated by an incremental elements constitute a subset of sequences. In the sort process, the successive decrease of the increment, and finally reduced to one when h when an insertion sort, sort completed. Incremental sequence generally use: ht = 2t-1, 1 ≤ t ≤ [log2n], in which n is the length of sequence to be sorted.