搜索资源列表
bianyi
- 汇编原理课设：主要有词法分析，语法分析，语义分析- A program to perform Euclid s Algorithm to compute gcd.
RSA
- RSA算法实验报告和代码 1.选取两个素数p,q（不可相差悬殊） 2.计算n=pq,f(n)=(p-1)(q-1) 3.选取e,满足1<e<f(n),则gcd(e,f(n))=1 4.计算d，满足de=1 mod f(n)。一般d>=[n的四分之一方],(e,n)为公钥，(p,q,d)为私钥，将明文0，1序列分组，使每组十进制小于n。c=[m的e次方] mod n,m=[c的d次方] mod n。-RSA algorithm and code an experi
prolog
- 用Prolog写的一些基本函数，如compress, decompress, pack, gcd, duplicate, sort-Some fundamental functions written in Prolog, such as compress, decompress, pack, gcd, duplicate, sort.
gcd
- oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
mimaxue
- 内含背包程序，RSA程序，中国剩余定理程序和GCD程序的源代码-Includes backpack program, RSA program, Chinese remainder theorem programs and GCD program' s source code
a10
- basic java program which can calculate the gcd of two integer -basic java program which can calculate the gcd of two integer ...
gcd2
- euclids algorithm that takes the gcd and converts it to find the largest and smallest gcd
Shell_Scripting
- Sample programs of shell scr ipting. finding the maximum no. finding the gcd of a no. etc.
gcd
- AntNet :Routing in Communication Networks -AntNet :Routing in Communication Networks
VHDLcodes
- Behavioral descr iption of ALU, RAM MODULE, ROM MODULE, DIVIDE BY N COUNTER, GENERIC DIVIDER 2n+1, GCD CALCULATOR, GCD FSM CODE, JK FLIP FLOP in VHDL . These are fully synthesized codes with optimization.- Behavioral descr iption of ALU, RAM MODULE,
gcd
- greatest common divisor c-greatest common divisor c++
Desktop
- 求两个数的最大公约数gcd()和仿射加密解密的c++算法- Asks two numbers the greatest common divisor gcd() c++ algorithm
hi-precision
- 实现大数操作的算法模板，重载了基本操作（+，-，* ，/），取模，次方，gcd等-Operation of the algorithm to achieve large numbers templates, overloads the basic operation (+,-,*, /), modulus, power, gcd, etc.
gcd_lcm
- 给出两整数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
power shell
- A Sample program on Microsoft Powershell. It have functions of Mathematical functions such as GCD,
Fraction
- Develop a Fraction class that is capable of doing arithmetic with fractions. * Fractions are held in lowest terms, with the gcd() method. * Use a toString() method to format the result.-Develop a Fraction class that is capable of doing arithm
VHDLvsVerilog
- This document is in two parts. The first part takes an unbiased view of VHDL and Verilog by comparing their similarities and contrasting their differences. The second part contains a worked example of a model that computes the Greatest Common Divisor
GCD
- 用VC++ 开发AutoCAD的一个简单的示例代码-a simple sample of VC++ developing autoCAD
GCD
- Help to find the Greatest Common Divisor of Numbers
gcd_lcm
- 求两个100以内整数的最大公约数和最小公倍数，只用加法和减法运算-Find the greatest common divisor of two integers less than 100 and the least common multiple, only addition and subtraction