AKS素判定算法的详细描述及C++实现。用的是DevC++环境，加载了NTL打证书库-Detailed descr iption AKS algorithm for prime recognition. Realization of AKS Prime Generator.

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.

RSA算法基于一个十分简单的数论事实：将两个大素数相乘十分容易，但那时想要对其乘积进行因式分解却极其困难，因此可以将乘积公开作为加密密钥。-RSA algorithm based on a very simple fact: the number multiplies two large prime number is very easy, but then to factorization of its product is extremely difficult, so it can be

求1~100中间的素数代码, -Find a prime number to 100 in the middle of the code, find a prime number to 100 in the middle of the code,

prime method is used for optimization