搜索资源列表
colorguide
- 简单的图形处理程序，供大家分享。程序运行后，首先从图中截取一块区域，然后程序会对这个区域计算像素均值和欧几里得差值，并得到结果。-Simple graphical procedure for everyone to share. Program runs, the first interception of a regional map, and then the procedure will be calculated in the region and the pixel average d
CTRL02
- Triangles can be classified according to the relative lengths of their sides: In an equilateral triangle all sides have the same length. An equilateral triangle is also a regular polygon with all angles measuring 60°.[1] In an isosceles triangle,
cPP
- 员工管理系统，简单大数问题，对称三位素数，欧几里得求最大公约数（差），深度优先搜索-Staff management system, the problem of large numbers is simple, symmetrical three primes, Euclid find the greatest common divisor (poor), depth-first search
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
extended_euclid.m
- Extended Euclid Algorithm in matlab.
Project1
- extended euclid algorithm in korean
EuDist2
- 快速求解欧几里得距离，线性时间就可以求解。-Quickly solve Euclid distance, can solve the linear time.
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.
mcd
- This program calculates the lowest common multiple of two numbers using Euclid s algorithm. To do this we will read the two numbers and we do accounts required to calculate
KuoZhanOuJiLiDeSuanFa
- 利用Visual C++6.0实现扩展的欧几里得算法，有详细的注释，帮助理解。-Euclid algorithm for Visual using C++6.0, with detailed notes to help understand.
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
Euclid
- 用C语言使用欧几里德算法求任意两个正整数的最大公约数-Realize, by using c/c++ or Matlab, the Euclidean algorithm and the extended Euclidean algorithm to calculate the greatest common division (GCD) of any two positive integer numbers
Heuristic function
- Heuristic function of Euclid- Manhattan and Diagonal distance comparison
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
OHDOB
- euclid算法的简单实现,比较简单,仅供大家参考()
conqrgctmonitor
- euclid算法的简单实现,比较简单,仅供大家参考()
zsbu
- RS译码的Euclid算法及其FPGA实现()