一种适合离散对数密码体制的素数生成方案

Generating Prime for Public Key Cryptosystem Based on the Discrete Logarithm

本文分析了文［１］中可证素数生成方法，探讨了离散对数密码体制对素数的安全性约束，最后对文［１］中的算法进行修改，形成一种适合离散对数密码体制的素数生成方案。

Ueli M.Maurer gives a fast prime generating method in reference .By modifying Maurer's method,we propose a prime generating scheme for the public key cryptosystem based on the discrete logarithm problem.We also discuss the security constriction to prime numbers in PKC based on the discrete logarithm