C++ An MD5 encryption algorithm. The need for encryption interface very useful

使用单片来进行CRC校验，可以位校验、半字节和字节校验-Using the single-chip to carry out CRC check, you can place check, half-byte and byte checksum

个人编写的简单gsm保密A5算法，思路有点凌乱， a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法a5算法

用途:自创加密算法-purposes : Inventing encryption algorithm

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

Rijndael algorithm修正了CBC下BUG的版本(有源代码）工作在：D5。作者：Sergey Kirichenko。--Rijndael algorithm that has revised BUG version under CBC(with source code).It works in D5. author:Sergey Kirichenko。

论Java加密技术与Windows的结合-On Java encryption technology and the integration of Windows

含有常用的一些加密标准算法实现- Includes the commonly used some encryption standard algorithms to realize

上传一个很好的加密算法。-Upload a very good encryption algrithm

非常详细的SM2、SM3、SM4算法说明及c语言代码，国密局公开算法。

希尔排序算法: 基本思想：将整个无序序列分割成若干小的子序列分别进行插入排序。 序列分割方法：将相隔某个增量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.