-
enumcsp
EnumCSP - Enumerates Crypto Service Providers
Copyright (c) 2000-2004 G.Chapillon
All Rights Reserved.
Contributor:
Jupiter -EnumCSP- Enumerates Crypto Service Providers Copyright (c) 2000-2004 G. Chapillon
- 2022-04-08 01:32:04下载
- 积分：1
-
Diamond加密算法
Diamond加密算法-A Diamond encrypt arithmetic
- 2022-05-08 21:12:42下载
- 积分：1
-
这是我用c++实现的一个DES加密算法！应该可以适合那些对加密感兴趣的人看。...
这是我用c++实现的一个DES加密算法！应该可以适合那些对加密感兴趣的人看。-This is achieved with c a DES encryption algorithm. Should be suitable for those interested in encryption right people.
- 2022-01-22 00:28:53下载
- 积分：1
-
TEA介绍及数据加密算法之程序代码
TEA介绍及数据加密算法之程序代码-TEA presentation and data encryption algorithm of the program code
- 2022-08-11 01:36:49下载
- 积分：1
-
图中加密应用程序的实现
Cryptography application implement in PIC
- 2023-06-25 15:55:03下载
- 积分：1
-
加密算法的使用示例
加密算法的使用示例-encryption algorithm using examples
- 2022-12-23 11:50:03下载
- 积分：1
-
aes的原代码，在ＶＣ＋＋的环境下运行．
aes的原代码，在ＶＣ＋＋的环境下运行．-Orangk"aes the original code in VC++ environment operation.
- 2022-06-26 17:11:23下载
- 积分：1
-
An improved tabu search algorithm to solve knapsack problem. The algorithm is ba...
提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局
部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具
体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。
关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan
- 2022-01-31 13:51:44下载
- 积分：1
-
rsa加密算法实例
rsa加密算法实例-rsa encryption algorithm examples
- 2022-11-16 00:45:03下载
- 积分：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
