| 基于频率的大素数高效生成算法 |
| |
| 引用本文： | 汤鹏志,李彪.基于频率的大素数高效生成算法[J].华东交通大学学报,2011(5):52-56. |
| |
| 作者姓名： | 汤鹏志 李彪 |
| |
| 作者单位： | 华东交通大学基础科学学院; |
| |
| 基金项目： | 国家自然科学基金项目(11061014); 江西省教育厅青年科学基金项目(GJJ10129);江西省教育厅科研项目(GJJ10708) |
| |
| 摘 要： | 公钥密码体制加解密算法基于两个大素数乘积的难分解性.为了提升大素数生成算法的效率和降低算法的报错率,提出了一种基于概率论的方法,通过优化Eratosthenes筛法构建素数库,从而通过分析素数库中素数尾数的分类频数和表达式下素数频率,再通过对素数检验算法进行分析,最后得到一种高效的大素数生成算法.在算法中,任意初始的整...
|
| 关 键 词： | 素数 Miller-Rabin算法 检验 生成 效率 |
Efficient Generation Algorithm of Big Prime Number Based on Frequency |
| |
| Tang Pengzhi,Li Biao.Efficient Generation Algorithm of Big Prime Number Based on Frequency[J].Journal of East China Jiaotong University,2011(5):52-56. |
| |
| Authors: | Tang Pengzhi Li Biao |
| |
| Institution: | Tang Pengzhi,Li Biao(School of Basic Sciences,East China Jiaotong University,Nanchang 330013,China) |
| |
| Abstract: | The security of RSA encryption algorithm is based on the decomposability of product of two big prime numbers.To ensure the security of RSA,two big prime numbers of sufficient length have been generat-ed.A method based on probability theory is proposed in order to improve the efficiency of this algorithm and re-duce the rate of error.A prime library is constructed through optimizing of Eratosthenes method,then by analyz-ing classification frequency of the prime mantissa in library,prime frequency of expressi... |
| |
| Keywords: | prime number Miller-Rabinc hecking generation efficiency |
| 本文献已被 CNKI 维普 等数据库收录！ |
