搜索资源列表
fermat
- 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
j-fermat
- 2007年robecode大赛亚军代码1!
DataSec
- VC++6.0实现快速、方便的费尔玛因子分解-Fermat of factor decomposition
1
- 原理类似伪费马小定理。 截尾减。 模拟人工判定 -Fermat' s principle of similar small theorem false. Censored minus. Analog manual to determine
Prime_Numbers
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be beca
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
mul_fft_96bit
- 基于Fermat数变换的大数相乘运算的Verilog实现，可应用于RSA加法芯片中。-Fermat number transform based on multiplying large numbers operations Verilog implementation, can be applied to RSA chip.
fermat_factor
- calculate fermat and shank s algorithms
CreatePrime
- 采用费马定理生成大素数的C语言源代码，开发工具为Visual 2008-Fermat' s Theorem by generating large prime numbers C language source code
poj2420
- poj2420AC代码，采用变步长法求解多边形的费马点-The code for poj2420,which can be used to find the fermat point of a polygon by way of changing step.
pollard
- Pollard p-1算法实现 Pollard 方法由Pollard于1974年提出，其基本想法是这样的：设素数，由Fermat小定理，又有，因此就可能是的一个非平凡因子。当然，问题在于我们并不知道是多少。一个合理的假设是的因子都很小，比如说，所有素因子都包含在因子基中，我们来尝试着找到一个能够“覆盖”，即是说，从而，因此我们可以转而求来获得所要的非平凡因子。例如设素因子上限为，便可以简单的取或是最小公倍数.-Pollard p-1 algorithm
Fermats-theorem
- 很好玩的数学知识，费马大定理，以简单幽默历史的方法向你展示数学的魅力-Fermat s theorem
fermat.cc
- which is uniformly distributed among 0 to 2^32-1 for each */ /* call. sgenrand(seed) set initial values to the working area */ /* of 624 words. Before genrand(), sgenrand(seed) must be */ /* called once. (seed is any 32-bit integer except for 0
Fermat
- calcola enigma di fermat
Fermat
- Fermats test to check for primality. Code is in java. takes a e=random number and gives whether it is prime or not.
Miller-Rabin_primality_test_(Java)
- Miller Rabin:Just like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that we want to test for primality.
Fermat_RSAkey
- 从RSAkey.txt中读取已生成的RSA密钥，形如n=pq（p和q皆为素数）的大整数，采用费马因子分解法对其分解，输出分解的结果和所费时间（单位为秒）。-Read from the RSAkey.txt RSA key, shaped like a large integer n = pq (p and q are prime numbers), using Fermat factorization method, decomposition, output decomposition res
sushu
- 素数的判定，miller-rabin，sol-str,leman,fermat等。都可以运行，下完自后自己稍微改改就可以用。-Primes judgment, miller-rabin, sol-str, leman, fermat so on. Can run is finished after their own little changed since it can be used.
4
- C源码：费尔马“二平方”素数,C源码：费尔马“二平方”素数-C source: Fermat " two square" primes, C Source: Fermat " two square" primes
algorithme-de-FERMAT
- algorithm of fermat crypto