摘要： 分析比较了两种大素数的搜索方法:随机搜索法和随机递增搜索法,理论分析和仿真结果均表明,随机递增搜索法优于随机搜索法。

关键词: 素数, 密钥, 搜索方法

Abstract: Two methods scanning randomly and scanning increasingly from a random point,which are used for finding large prime numbers are analyzed and compared. Both results from the theoretic analysis and simulation show that scanning increasingly from a random point is much better than scanning randomly.

中图分类号: 

• TN918.1