PrimeNum程序描述： 本程序包括：找100～200间的素数 主要是记住找素数的算法-PrimeNum procedures Descr iption : The procedures include : find 100 ~ 200 of the Primes is mainly remembered for a number of algorithm -

这是一个MFC工程，包括可执行文件以及源代码。对素数判定有两种方法，一种是Erato算法，另外是混合判定算法。可以快速且准确的判定一个大数是否为素数。-This is a MFC project and the executive file and the source files are all included in it. There is two kinds of methods to recognize if a number is a prim. One of the methods

随机搜索大素数，随机生成公钥和私钥； 要求使用素性检测算法及高效率求逆和模幂运算 用私钥对任意长度的明文签名 用公钥对签名验证；-Random search large prime Numbers, random public key and a private key Requires the use of element detection algorithm and efficient inverse power operation and mould With the