-
实现本机加密
实现本机加密-The realization of the local encryption
- 2022-11-22 11:30:03下载
- 积分：1
-
source for the realization of PKCS# 12 standard
PKCS#12源程序，用于实现PKCS#12标准-source for the realization of PKCS# 12 standard
- 2022-01-25 14:38:26下载
- 积分：1
-
RSA的类的源代码，Visual C++ 6.0实现。该算法（不是指代码）虽然有诸多缺点，但目前应用广泛。该代码的思路清晰，容易学习掌握。...
RSA的类的源代码，Visual C++ 6.0实现。该算法（不是指代码）虽然有诸多缺点，但目前应用广泛。该代码的思路清晰，容易学习掌握。-RSA class
- 2022-01-24 15:25:01下载
- 积分：1
-
128 bit AES Pipelined Cipher
The Advanced Encryption Standard (AES) specifies a FIPS- approved cryptographic algorithm that can be used to protect electronic data.
The AES-128 pipelined cipher module uses AES algorithm which is a symmetric block cipher to encrypt (encipher) information.
This module is optimized for speed as it pipeline hardware to perform repeated sequence called round
- 2022-01-25 21:48:15下载
- 积分：1
-
系统可以显示我的CA根证书userds存储，代码参考价值。
可列出系统MY CA ROOT USERDS等存储区的证书，代码参考msdn-system can be shown MY CA ROOT USERDS storage of certificates, reference code VARIANT
- 2022-01-28 16:37:17下载
- 积分：1
-
des和rsa加密算法程序
des和rsa加密算法程序-des and rsa encryption algorithm procedures
- 2022-03-21 19:07:45下载
- 积分：1
-
这是一个霍夫曼编码程序
这是一个霍夫曼编码程序-This is a Huffman code program
- 2022-02-16 05:22:56下载
- 积分：1
-
DEC算法的C实现
DEC加密算法，信息安全类别，可以实现VC窗口验证的脚本。64位的明文输入块变为64位64位数据块按位重新组合，并把输出分为R0两部分，每部分各长
- 2022-08-15 10:32:22下载
- 积分：1
-
标准C++书写的BlowFish加密算法，和加密文件演示，速度较快
标准C++书写的BlowFish加密算法，和加密文件演示，速度较快-written in standard C BlowFish encryption algorithm, and encryption paper presentations, faster
- 2022-03-07 10:15:31下载
- 积分：1
-
山排序算法：基本思想：全序无序分离…
希尔排序算法:
基本思想：将整个无序序列分割成若干小的子序列分别进行插入排序。 序列分割方法：将相隔某个增量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.
- 2022-02-06 21:23:34下载
- 积分：1
