对于米勒拉宾随机概素数搜索迭代阈值表生成器。

In a random, probable prime search, the Miller-Rabin strong probable prime (or compositeness) test requires a certain number of iterations to achieve an acceptably low probability of failure - that is, the probability that a composite will be incorrectly declared prime. The mrtab utility generates a k-bit threshold table for the number of iterations required to achieve a specified upper-bound for the error probability - denoted in the literature as p(k, t). These concepts are central to the generation of industrial strength primes, as used in public key cryptography. A minimal iteration count, based on number-theoretic results, is of particular interest for efficient key generation in constrained environments, such as low-power portable devices and smart cards.

theory
dlpp2.c
mrtab.c
rbj4.c
rbjcs.c
spk12.h
sprp2.c
sptab.c