搜索资源列表
kzojldsf
- 扩展欧几里得算法 和大数模运算算法 自己写的注释，绝对好用。-expansion Euclid algorithm and computation algorithm for Modular himself wrote the notes, definitely handy.
EUCLID
- 欧几里德算法：非常实用的！经调试通过！源代码不需任何修改！
TestRsa
- 个人编的rsa的源代码，算出public—private key；其中有Euclid，Extend Euclid的实现，以及Millar-Rabin test的实现，和加密/解密
rsa
- 算法不是很难，不过当初在写扩展欧几里得的时候还是不是处理得很好，现在改了下传上来，写得不好欢迎大家指点-Algorithm is not difficult, but was extended in Euclid' s time to write or not to deal with very well, and now up to the next mass, not well written advice welcome
gcd
- oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
euclid
- 最简单、最基础的欧几里得算法，运用此代码可以实现欧几里得算法的一般功能-euclid
xinxisafe
- 信息安全实验代码 包括维吉尼亚密码 凯撒密码 欧几里得密码 置换密码等，附实验报告-Test code includes information security Caesar Virginia password passwords password Euclid password replacement, with test report
Euclid
- 扩展欧几里得算法的大数实现,实现任意两个大数求莫逆-Large numbers of extended Euclidean algorithm implementation
euclid4
- Visual studio c++ 2010 express implementation of euclid algorithm
euclid2
- visual studio c++ 2010 express extended euclid algorithm
rsa
- RSA编码实现，创建公钥和私钥，并判定生成的是否是素数，生成界面和菜单便于用户选择，用扩展欧几里得短发求乘法逆元，快速模幂算法，-RSA Coding, create public and private keys, and determine whether the resulting number is a prime generate user-friendly interface and menu choices, with short hair extensions Euclid se
New-folder-(4)
- We begin with choosing two random large distinct primes p and q. We also pick e, a random integer that is relatively prime to (p-1)*(q-1). The random integer e is the encryption exponent. Let n = p*q. Using Euclid s greatest common divisor a
SkFontConfigTypeface
- euclid s algorithm works with doubles note, doubles only get us up to one quadrillion or so, which isn t as much range as we get with longs. We probably still want either 64-bit math, or BigInteger.
RSA
- 利用C\C++实现RSA算法的加、解密运算。 具体包括： 1）利用扩展的Euclid计算 a mod n 的乘法逆元； 2）Miller-Rabin素性测试算法对一个给定的大数进行测试； 3）实现的运算，并计算； 4）利用Euler定理手工计算，并与3）计算的结果对比； 5）实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加解密。说明：为了方便实现，分组可以小一点，比如两个字母一组。
DigitalSignatureStandard(DSS)
- 运行程序之前需要配置OpenSSL的开发环境（SHA-1算法利用OpenSSL开发包实现），本源代码实现了DSS数字签名（美国标准数字签名标准），主要运用了大整数的加减模幂、以及欧几里得算法。并有一个完整的界面。-You need to configure before running the program OpenSSL development environment (SHA-1 algorithm uses OpenSSL development package implementati
extendedeuclid
- 作者身份：华南理工大学知识产权学院王桂林，这是我自己编写的拓展欧几里得算法，用于实现RSA加密中的求模数乘法逆元，适合初学者作参考代码。文件内容是VS C++项目文件。(I am a student who is from South China University of Technology.This is a realization of the extended Euclid calculation, which can be used to do the RSA. I suggest