这是个很容易且广泛使用的简单算法，它基于Gary Miller的部分象法，有Michael Rabin发展。事实上，这是在NIST的DSS建议中推荐的算法的一个简化版。

首先选择一个代测的随机数p，计算b，b是2整除p-1的次数。然后计算m，使得n=1+(2^b)m。-This is a very easy and simple and widely used algorithm, which is based on some of Gary Miller as the law, there is the development of Michael Rabin. In fact, it is recommended in the NIST' s DSS recommended a simplified version of the algorithm. First of all, choose a random number generation test of p, calculated b, b is divisible by 2, the number of p-1. Calculation of m, making n = 1+ (2 ^ b) m.