搜索资源列表
程序分析3
- 题目：用c 语言编写的程序，一个偶数总能表示为两个素数之和。-Tilte:a programme written by c: an idol can always be expressed as summation of two prime numbers.
20030507155828_sieve5
- 该程序用于在一个给定的数组中寻找素数，它使用一个1很经典的算法，效率很高。-the procedures used in a given array of finding prime numbers, it uses one of a classic algorithms, high efficiency.
363710169
- 求出1000以内的全部素数。 求出1000以内的全部素数。-sought within the 1000 all primes. Get all within the 1,000 prime numbers. Get all within the 1,000 prime numbers.
daima
- 这是一个求1到100的所有质数的程序，运行后屏幕上显示1到100的所有质数-This a program which caculates all prime numbers from 1 to 100. The output of the program is all the prime numbers from 1 to 100 on the screen.
poj1811
- 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number
数据结构算法集锦
- 数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm,
编写一个判断一个数字是否是素数的函数
- 编写一个判断一个数字是否是素数的函数，利用该函数求200以内的素数之和。（素数指除了1和它本身之外，该数没有其他因子，例如101就是一个素数。）-Write a judge whether a number is prime function, using the function evaluation within 200 prime numbers. (In addition to a prime number, and it refers to itself, not the number
RsaTool.自己写的RSA算法工具
- 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。,Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that goo
mulf2m.rar
- 椭圆曲线加密算法中的乘法器的生成，主要功能是实现在素域上的多项式模P(大素数）乘的运算。,Elliptic curve encryption algorithm to generate the multiplier, the main function is to achieve in the Su-domain polynomial module P (large prime numbers) by the operator.
win32
- 使用win32线程库实现的多线程求解素数程序，输入素数即可求得小于该素数的所有素数-Using the win32 thread library implementation of multi-threaded prime number solver program, enter the prime numbers less than the prime number can be obtained for all primes
java7_13
- 倒序显示小于120的所有素数，使用Stackof_Integers类存储这些素数，提取并倒序显示他们。-Show reverse all prime numbers less than 120, the use of these prime Stackof_Integers class storage, extraction and reverse display them.
1002
- Sicily上的1002题，主要是为一些初学者设计的-Problem Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if
genprime
- 基于大数库miracl的快速产生大素数的c语言实现（输入的随机种子不同产生的大素数也不同）-Based on the rapid creation of large numbers library miracl large prime numbers c-language implementation (a different type of random seed generated large prime numbers are different)
multithread
- 多线程的程序，求素数。用户运行程序时在命令行输入一个素数，然后程序创建一个独立新的线程来输出小于或等于用户所输入数的所有素数。-Multithreaded program, find the prime numbers. When users run the program on the command line enter a prime number, then the program creates a separate new thread to output less than or
ss
- 很多密码算法都要随机选择一个大素数，这个是密码学中的MILLER-RABIN算法，判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
rsa_small_num
- 本程序主要功能: 1、编写程序构造一RSA密钥； 2、编写程序实现快速指数算法； 3、编写程序生成大素数； 4、实现RSA密码体制。-Main function of this procedure: 1, construct an RSA key programming 2, programming algorithm for fast index 3, write a program generating large prime numbers 4, to achieve
RSA_java
- 带界面的RSA算法，软件包中含有可执行程序，功能有自动生成随机素数P、Q，公钥，密钥，对数字进行加密解密。-Interface with the RSA algorithm, packages containing executable programs, automatic generation of random functions of prime numbers P, Q, a public key, keys for encryption and decryption of digit
ecmnet20ksrc
- 分布式大数分解程序源码，可以再多台机器上利用数域筛法分解大素数。-Distributed integer factorization program source code, the more the machine can use the number field sieve factoring large prime numbers.
Thread_Experiment
- Write a multithreaded Java, Pthreads, or WIN32 program that outputs prime numbers. This program should work as follows: The user will run the program and will enter a number on the command line. The program will then create a separate thread that out
acm
- acm中各种代码，除此参与acm有欧几里得，拓展欧几里得，求素数等问题-acm various code involved in addition there acm Euclid, Euclid expansion, and issues such as prime numbers