搜索资源列表
BigInteger_src
- C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random ran
WinNTL-5_5_2
- ntl是有纽约大学研究开发的专门处理大数计算的一个静态库，在取模，大数分解方面有很广泛的应用-ntl is a New York University specializing in research and development of large numbers for calculation of a static library, in modulus, decomposition of large numbers has very broad application
RSA
- 本软件围绕小模数RSA的实现这一主题，用图形化界面实现了密钥的随机产生、加密数据、解密数据等功能。所用语言：C# -This software around the small modulus RSA implementation of this theme, graphical interface to achieve a randomly generated key to encrypt data, decrypt data and other functions.
Vigenère
- 维吉尼亚算法的实现，构成 明文：每个字符惟一对应一个0~25间的数字。 密钥：一个字符串，其中每个字符同明文一样对应一个数字，代表位移值，如a 表示位移 0，b 表示位移 1，c 表示位移 2，...... ）。 加密过程： 将明文数字串依据密钥长度分段，并逐一与密钥数字串相加（模26），得到密文数字串； 最后，将密文数字串转换为字母串。 -Virginia algorithm constitutes explicit: Each character correspon
dh
- 单机版多对象进行密钥交换，内部提供了关于超过int范围的数值进行取模运算的反法。-Stand-alone version of multi-object for key exchange, internal information on the scope of more than int values modulus operator s anti-law.
BIGIL
- 128位大整数运算源代码 源代码包含128位大整数的加减乘除、取模、乘幂、2进制和10进制转换等运算，可用于大整数运算和加解密算法。 -128 large integer computing source code source code contains 128 large integer addition and subtraction, multiplication and division, modulus, by power, 2-band and 10 hexadecimal
Locksoft
- 文件包括rsa算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Rsa algorithm for the original documents, including procedures and detailed notes. 1024 can be achieved over the use of large prime numbers for encryption an
IDEA
- Markov密码的(差分链)转移概率矩阵是双随机矩阵，其第二大（模）特征值对于确定Markov密码必要的迭代轮数有重要价值。该程序由本人编写，实现了求IDEA密码的缩小模型IDEA(8)的转移概率矩阵П0第二大（模）特征值-Markov password (differential chain) transition probability matrix is a doubly stochastic matrix, its second largest (modulus) eigenvalue
gcd
- The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, define recursively as follows. It y is equal to 0, then gcd(x
Affine-password
- 一个经典的古典加密算法（仿射变换加密算法）的设计与实现，里面包含了一个求模数的逆的算法-A classic classical encryption algorithms (affine transform encryption algorithm) design and implementation, which includes a number of inverse modulus algorithm
RSA
- // Struts2 Action方法中： // 将公钥的 modulus 和 exponent 传给页面。 // Hex -> apache commons-codec RSAPublicKey publicKey = RSAUtils.getDefaultPublicKey() ActionContext.getContext().put("modulus", new String(Hex.encodeHex(publicKey.get
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