DSA

enigma.zip(VB)一个德国的enigma加密技术例子COOL,原程序不支持明文是汉字，添加了一个小模块 -enigma.zip (VB), a German enigma encryption technology COOL example, the original program is not expressly support Chinese characters, add a small module

Shamir门限算法的C++实现，依赖于NTL开源代码库(Shamir threshold algorithm C++ implementation, relies on NTL open source code base)

jsse使用范例，通过sokcet通讯建立安全数据传输-JSSE using the example of communication through the establishment of security Sokcet data transmission

针对32位MIPS微处理器中CLZ指令（对单个字高位连零进行计数）的实现电路，使用了类似于超前进位的逻辑结构。包含测试文档，以及Design Compile所用的环境和脚本。(The CLZ instruction counts the number of leading zeros in a word. The 32-bit word in the GPR rs is scanned from most-significant to least-significant bit.The number of leading zeros is counted and the result is written to the GPR rd. If all 32 bits are cleared in the GPR rs, the result written to the GPR rd is 32. )

基于VB的M5数学密码算法源码,有需要的就下载吧。(VB-based M5 mathematical algorithm source code, there is a need to download it.)

说明：  RSA的加密和解密。运行在VC++6.0下。(RSA encryption and decryption)

dsa加密算法，一种常用的数据加密算法的c++语言实现，具有很强的适用性和参考价值-failed to translate

实现了图像的加密和解密，密钥是0--9之间的任意数字，但加密密钥和解密密钥相同(The realization of an image encryption and decryption, key is 0- 9 between arbitrary figure, but the encryption key and decryption key the same)

RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s

对初学MALAB读的经典外文书籍，简单易懂，有简单代码-Novice MALAB reading the classic books in foreign language, easy to understand, there is a simple code