Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - gcd.a

Search list

[Other] number_theory_c++

Description: 数论算法库 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随机性素数测试算法
Platform: | Size: 9769 | Author: henry | Hits:

[Crack Hack] gudianmima

Description: 古典密码中，主要的思想为移位算法及置换算法。 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.维吉尼亚密码 首先确定密钥长度（本例中密钥只采取个位数字，所以取决于输入密钥的长度），然后输入满足这个长度的向量；加密：取明文第一个字母并将之移k1位，这里k1=1,第二个字母移k2位，k2=2,一旦到了密钥末尾，又从头开始。 4.换位密码 首先确定密钥长度，输入长度为5的0到4的整数序列，将明文分成每5个字母一组，每组字母按照密钥进行换位。
Platform: | Size: 3852 | Author: 徐凯波 | Hits:

[Other] number_theory_c++

Description: 数论算法库 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随机性素数测试算法 -Number theory algorithms library C++ Language content code number theory algorithm library, which includes the following algorithms: Euclidean algorithm for a, b of the largest common multiple extended Euclidean algorithm, to derive gcd (a, b) and to meet gcd (a, b) = ax+ by the integer x and y-mode linear equations to solve ax ≡ b (mod n) in which n> 0 solving mode of linear equations (China remainder theorem) mode calculation computing exponentiation a ^ b mod n (a, b may be a lot) Miller-Rabin random prime number testing algorithm
Platform: | Size: 9216 | Author: henry | Hits:

[Crack Hack] BigInteger_src

Description: 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 rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) , -C# BigInteger class. BigInteger.cs is a cs harp 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 rand). genRandomBits (int bits, Random rand). isProbablePrime (int confidence). isProbablePrime (), Jacobi (BigInteger a, BigInteger b), LucasSequence (BigInteger P, BigInteger Q, BigInteger k, BigInteger n), max (BigInteger bi), min (BigInteger bi). modInverse (BigInteger modulus). RabinMillerTest (int confidence),
Platform: | Size: 35840 | Author: jason.. | Hits:

[Crack Hack] gudianmima

Description: 古典密码中，主要的思想为移位算法及置换算法。 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.维吉尼亚密码 首先确定密钥长度（本例中密钥只采取个位数字，所以取决于输入密钥的长度），然后输入满足这个长度的向量；加密：取明文第一个字母并将之移k1位，这里k1=1,第二个字母移k2位，k2=2,一旦到了密钥末尾，又从头开始。 4.换位密码 首先确定密钥长度，输入长度为5的0到4的整数序列，将明文分成每5个字母一组，每组字母按照密钥进行换位。 -err
Platform: | Size: 4096 | Author: 徐凯波 | Hits:

[Algorithm] GCD

Description: 最大公约数最小公倍数的C++求解，提供了多种思路解答，-Common denominator least common multiple of the C++ Solution, provides a wide range of ideas answers
Platform: | Size: 6144 | Author: 成龙 | Hits:

[Algorithm] GCD

Description: GCD为一个求取最大公因素的程式，输入两个数可以求得两数的最大公因素-GCD is a greatest common factor to strike the program, enter two numbers to achieve two of the greatest common factor in several
Platform: | Size: 5120 | Author: 陳悟 | Hits:

[Crack Hack] GCD

Description: 求sa和tb的和使等于a和b的最大公约数-For sa and tb, and so equal to a and b of the common denominator
Platform: | Size: 247808 | Author: 赵国振 | Hits:

[SCM] ou

Description: 欧几里德算法：辗转求余　　原理: 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 accept the previous scanf carriage return
Platform: | Size: 2048 | Author: 俞佳 | Hits:

[assembly language] gcd

Description: 从键盘输入两个常数，求其最大公约数，并以常数形式输出-the greatest common divsion
Platform: | Size: 23552 | Author: sjchan | Hits:

[ActiveX/DCOM/ATL] gcd

Description: A simulation of a circuit to calculate GCD Greater Common Divisor.
Platform: | Size: 1024 | Author: EVAN | Hits:

[Crack Hack] gcd

Description: oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
Platform: | Size: 1188864 | Author: li | Hits:

[Compress-Decompress algrithms] Poly_GCD_POWER_6_July2005

Description: If we need to verify the fact that a Polynomial has multiple roots iff (if and only if) it has a common factor with it s derivative, we need two things : a) A function to compute the GCD of 2 Polynomials. Since I could not find a Standard Matlab function for this, I created this function : Poly_GCD.m :
Platform: | Size: 93184 | Author: 邹娟 | Hits:

[Other] gcd

Description: to get GCD(A,B)，and no recursion -to get GCD(A,B),and no recursion
Platform: | Size: 4096 | Author: WEIJINGJING | Hits:

[VHDL-FPGA-Verilog] gcd

Description: 这是一个求最大公约数的verilog源码-this is a verilog source code which can count the greatest common divider .
Platform: | Size: 312320 | Author: 杨振飞 | Hits:

[Algorithm] gcd_lcm

Description: 给出两整数a与b, 找出a与b的最小公倍数LCM(a,b), 找出a与b的最大公因子GCD(a,b).-finds the LCM(Lowest Common Multiple)/GCD(Greatest Common Divisor) of two positive integers
Platform: | Size: 1024 | Author: jason.. | Hits:

[Crack Hack] gcd

Description: 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,y) is x otherwise, gcd(x, y) is gcd(y, x y), where is the modulus function. [Note: For this algorithm, x must be larger than y.] Write a driver program ( main() function ) to test your function.-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,y) is x otherwise, gcd(x, y) is gcd(y, x y), where is the modulus function. [Note: For this algorithm, x must be larger than y.] Write a driver program ( main() function ) to test your function.
Platform: | Size: 506880 | Author: Jack | Hits:

[Graph Drawing] GCD

Description: 用VC++ 开发AutoCAD的一个简单的示例代码-a simple sample of VC++ developing autoCAD
Platform: | Size: 67584 | Author: dmliu | Hits:

[VHDL-FPGA-Verilog] gcd

Description: this a program to calculate the gcd of two numbers and then display the result-this is a program to calculate the gcd of two numbers and then display the result
Platform: | Size: 176128 | Author: nauman | Hits:

[VHDL-FPGA-Verilog] gcd

Description: 在VHDL里面实现一个简单的GCD算法，包含源代码，并且通过了编译和综合。-Inside the VHDL to implement a simple GCD algorithm, including source code, and through the compilation and synthesis.
Platform: | Size: 205824 | Author: fuxing | Hits:
« 12 3 4 »

CodeBus www.codebus.net