搜索资源列表
gcd.rar
- 求几个数的最大公约数及最小公倍数
a223
- 此程式可輸入二個整數,並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
number_theory_c++
- 数论算法库 C++ 语言实现 代码内容 数论算法库,包括以下算法: 欧几里德算法求a,b的最大公倍数 扩展的欧几里德算法,求出gcd(a,b)和满足gcd(a,b)=ax+by的整数x和y 求解模线性方程 ax ≡ b (mod n) 其中n>0 求解模线性方程组(中国余数定理) 模取幂运算 计算a^b mod n (a,b可能很大) Miller-Rabin随机性素数测试算法
7_Rsa
- RSA公钥加密算法基于大整数因式分解困难这样的事实。 选择两个素数,p,q。(一般p,q选择很大的数) 然后计算 z=p*q f=(p-1)(q-1) 选择一个n,使gcd(n,f)=1(gcd代表greatest common divider,一般n也选择一个素数), n和z就作为公钥。 选择一个s,0<s<f,满足n*s % f=1,s就作为私钥。-RSA public key encryption algorithm based on the integer fa
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
gcd
- 密码学基础中求一个元素模p的逆元素,用扩展的欧几里德算法
gudianmima
- 古典密码中,主要的思想为移位算法及置换算法。 1.移位密码 密钥K为整数,且取值空间为0到25;加密函数:x = x + k (mod 26);解密函数:x = x - k (mod 26)。当K=3时,为凯撒密码。 2.仿射密码 密钥对由a、b组成,整数a满足 gcd(a, 26) = 1,整数b的取值空间为0到25;加密函数:x = ax + b(mod 26);解密函数:x = a*y - a*b (mod 26)。当a=1,b=3时,为凯撒密码。 3.维吉
GCD
- 最大公约数最小公倍数的C++求解,提供了多种思路解答,
最大值及最大公约数
- 求最大值及最大公约数。这是我初学C语言的一个源程序,希望对初学者有所帮助。-This program is going to get the maxium number and GCD.This source is the result of my first learning C,I hope it can be helpful for the first learner.
Task-1-4
- finding GCD of two numbers
gcd
- 求几个数的最大公约数及最小公倍数- Asks several integers the greatest common divisors and 鏈
GCD_recursion
- 用递归方法求最大公因数!!!不是什么难的程序,小的程序。。大家一起探讨!-Method Using Recursive gcd! ! ! Not a difficult procedure, a small procedure. . Everyone to explore!
GCD
- 求sa和tb的和使等于a和b的最大公约数-For sa and tb, and so equal to a and b of the common denominator
Euclidium
- 歐基理德輾轉相除法(之一) 以歐基理德輾轉相除法求出m,n這2個整數的最大公因數 -Reed Euclid division algorithm (one) to Euclid division algorithm Reed obtained m, n this two integers gcd
fasterEuclidium
- 歐基理德輾轉相除法(之二) m與n相差太大時,可用(m%n)來取代(m-n),這樣的處理效率較高。以下便以此方法求出最大公因數。 -Reed Euclid division algorithm (II) m and n be too significant, the available (m% n) to replace the (mn), this kind of treatment more efficient. The following will be obtained in t
ou
- 欧几里德算法:辗转求余 原理: gcd(a,b)=gcd(b,a mod b) 当b为0时,两数的最大公约数即为a getchar()会接受前一个scanf的回车符-Euclidean algorithm: Principles of travel for more than: gcd (a, b) = gcd (b, a mod b) when b is 0, the two common denominator is the number of a getchar () will ac
recurs
- /* Divide and Conquer */ /* Find minimum and maximum from a given series of numbers */ /* by using above said policy */ gcd fibonacci-/* Divide and Conquer*/ /* Find minimum and maximum from a given series of numbers*/ /* by using
EuclideanalgorithmfGCD
- In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not
BasicRSA_latest.tar
- RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman i
least_common.tar
- a linux program that enables to find the least common multiple of two integers. by means of this lcm, you can easiky find the gcd.