LaoenED.com/LaoenED.exe for DOS/Windos9x/2k/XP LaoenED.exe for the user. A small...

SHa1,经典加密算法,时代之骄傲-SHa1, classical encryption algorithm, proud of the times

C++ MD5开发组件-C++ MD5 development component

关于RSA算法的完整性/***lt；Pgt；部分：RSA lt；/Pgt；*lt；Pgt；描述：Encodage de donn idle s selon le protocole RSA lt；/Pgt；*lt；Pgt；版权所有：Copyright（c）2004lt；/Pgt；*@author Fran正在继续Bradette**@version 1.1 version originale de Robert Sedgewick and Kevin韦恩。版权所有2004*pris sur le现场http://www.cs.princeton。*修饰语edu/introcs/104crypto/RSA.java.html文件帕弗兰在继续，布拉德特*/

C++下的base64编码，能够支持任何数据进行base64编码。 -C++ Under the base64 encoding, can support any data base64 encoding.

采用高级加密标准aes算法针对流媒体加密程序-Using the Advanced Encryption Standard algorithm aes encryption for streaming media

密码编码学――加密方法的C与C++实现，该程序最好在VC环境下编译-cryptographers-- encryption methods of C and C to achieve the best procedures in the VC environment compiler

列出系统中所有的证书存储区和物理位置 代码参考msdn-listed all the system certificate and the physical storage location code reference VARIANT

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

Decryption for advanced system can be used for aes 128

使用标准C++开发的SHA-1算法的实现-Using standard C++ Developed SHA-1 algorithm