这是个好东西，可以代替系统的记事本。

一种用于新型MD5的加密算法，使用 ASP语言版-A new MD5 encryption algorithm, the use of ASP language version

VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.-VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some

一个简单实现RC5加密算法的例子！仅供参考！-Realize a simple example of RC5 encryption algorithm! For reference purposes only!

完全解决了中文问题- Completely has solved Chinese problem

动画介绍aes的详细步骤，生动简单，是很容易理解的动画演示，很好-Animation aes detailed steps, vivid simple and is very easy to understand animation, very good

MyMD5.DLL及测试代码(详见附件)-MyMD5.DLL and testing of code (see Annex)

一个加密机用来注册用的可以加进你自己的程序里可以试试挺部错的！-an encryption machine used for the registration can add your own procedures you can try Ting Ministry wrong!

　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用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

著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.

HAMMING ECC，1 BIT ERROR CORRECTION， 2 BITS ERROR DETECTION -HAMMING ECC，1 BIT ERROR CORRECTION， 2 BITS ERROR DETECTION