搜索资源列表
0029
- 操作系统中读者写者问题拟操作系统里实现读者－写者问题的程序实例。用vc++编写，直接打开工程文件即可调试-OS readers to write to the problem of the operating system, achieving readers - who wrote the program examples. Vc with the preparation, direct project documents can be opened Debugging
inverse
- 有限域上逆运算是密码学中常用的运算。本程序提供有效、快速的有限域上逆运算程序解决求逆问题。-The inversion operation of a finite field is commonly used in cryptography operations. The program provides effective, fast algorithm and program for computing the inverse problem in the finite field.
openssl-0.9.8e
- 设置RSA结构中的method，当用户实现了一个RSA_METHOD时，调用此函数来设置，使RSA运算采用用户的方法。-very good you could make it,please hit it,you have no problem ,Are you ok? maybe we could mak it later.
12
- 很自然可以考虑到 问题解决的这一层 或许是自然属性的最高级 就是说我们不能再找到比它更合适 更抽象的表述了 同时我们也能得到 这样的方法 其实侧面的证明了 自然方案的有限性 即 如果能够 那我们可以在有限的空-时范围内 认识该范围 的所有自然属性 当你遇到一个SB的时候 请注意 一定要尽可能的给他舞台 让他尽情的发挥 这样才有可能 让他自己觉得自己有多么得SB -Hen naturally consider the problem solving of this layer m
Mdbmmpj
- MDB密码破解,主要帮助大家解决MDB遗忘密码的问题-MDB password cracking, mainly to help solve the problem of the MDB forgotten password
10B8B
- 8B_10B译码程序已通过验证，程序波形与输出没有问题-8B_10B decoding program has been validated, the program is no problem with the output waveform
Elgamal
- ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two rando
moshipipei
- c语言中的模式匹配问题以及代码 希望大家喜欢-c language pattern matching problem and I hope everyone likes the code
ChaosEncryptionJavaAnbeirar
- Modern symmetrical encryption systems use a starting “key” that is up to 256 bits long (for us civilians anyway) and combine this with an initialization-vector (also up to 256 bits long). By applying the vector to the key through some scary mathemati
rsa
- RSA算法，基于大整数分解的难题而设计的非对称密码算法。-RSA algorithm, based on the integer factorization problem designed asymmetric cryptographic algorithm.
discrete_log
- Solve descrete log problem using meet in the middle attack. More formally, write a program to compute discrete log modulo a prime p. Let g be some element in Z p and suppose you are given h in Z p such that h = gx where 1 ≤ x ≤ 240. Your goal
diffie_hellman
- Implement Diffie-Hellman Key exchange protocol and demonstrate that at the end, both person will have a common Key. Do the following: 1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5). 2. Generate a, a random number mod p. Now generate A,