搜索资源列表
kzojldsf
- 扩展欧几里得算法 和大数模运算算法 自己写的注释，绝对好用。-expansion Euclid algorithm and computation algorithm for Modular himself wrote the notes, definitely handy.
EUCLID
- 本程序完成了欧几里得算法求最大公约数、扩展欧几里得算法求乘法逆元和素性检验判断输入的数是否为素数
kzojldsf
- 扩展欧几里得算法 和大数模运算算法 自己写的注释，绝对好用。-expansion Euclid algorithm and computation algorithm for Modular himself wrote the notes, definitely handy.
EUCLID
- 本程序完成了欧几里得算法求最大公约数、扩展欧几里得算法求乘法逆元和素性检验判断输入的数是否为素数-This procedure for the completion of the Euclid algorithm for greatest common divisor, extended Euclid algorithm for multiplication and inverse primality test to determine
ojld
- 可以输出最大公约数 用Java语言实现扩展欧几里得算法 -Common denominator can be output using Java language extended Euclid algorithm
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
POJ2115
- ACM POJ 2115 扩展欧几里得算法解题报告-ACM POJ 2115 Euclid algorithm for solving the report of the expansion
shanks
- 求离散对数的shanks算法，要求如下： 实现计算 Zp 中计算离散对数的 Shanks 算法，基本要求如下： 1）p 是一个小素数( 小于 32 bit )，a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试)； 2）采用快速模指数算法求幂（如am），采用扩展欧几里得算法求逆（ 如a-i (mod p) ）； 3）采用
Extended-Euclidean-algorithm
- 简单的扩展欧几里得算法，实用，大家可以直接套用。-Extended Euclidean algorithm is simple and practical.
Primality-testing
- 使用扩展欧几里得、平方乘等函数对较大的随机数进行素性检测-Primality testing
Euclid
- 扩展欧几里得算法的大数实现,实现任意两个大数求莫逆-Large numbers of extended Euclidean algorithm implementation
ExtendedEuclid_MMY
- 密码箱作业：具有可视界面的扩展欧几里得算法-Extended Euclidean algorithm
oujilide
- 欧几里得算法，很详尽的解释说明，扩展欧几里得算法，求最大公约数-Euclidean algorithm, a very detailed explanation, extended Euclidean algorithm, find the greatest common divisor
gcd_and_extend_gcd
- 欧几里得算法与扩展欧几里得算法求最大公约数与乘法逆元-Euclidean algorithm and extended Euclidean algorithm for the greatest common divisor and multiplicative inverse
ExtendedEucA
- C#实现扩展欧几里得算法，加密解密算法中常用。-C# implementation of extended Euclidean algorithm, encryption and decryption algorithms commonly used.
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 s
ou
- 扩展欧几里得 方程ax + by = C的（x）最小正整数解 - Equation AX+ by = C (x) minimal positive integer solution
math
- 提供欧几里得算法、扩展欧几里得算法、求素数算法、高斯消元算法-Provide the Euclidean algorithm, the extended Euclidean algorithm, the algorithm for prime numbers, Gauss elimination algorithm etc.
sgu261
- sgu261：Discrete Roots(原根+离散对数+扩展欧几里得) 题目大意： 给你两个质数p,k，和整数a(0≤a<p)，求解所有满足x^k≡a(mod p)的x。-261. Discrete Roots time limit per test: 1 sec. memory limit per test: 65536 KB input: standard output: standard
2
- 扩展欧几里得算法，用c语言写的。希望采纳。(I don't konw how to translate this. Just read the chinese. It's simple.)