| 两种求二次剩余平方根算法的比较 |
| |
| 引用本文： | 蔡兆政,瞿云云,包小敏.两种求二次剩余平方根算法的比较[J].西南农业大学学报,2019,41(1):60-64. |
| |
| 作者姓名： | 蔡兆政 瞿云云 包小敏 |
| |
| 作者单位： | 西南大学数学与统计学院;贵州师范大学数学与计算机科学学院 |
| |
| 基金项目： | 国家自然科学基金项目（61462016）；贵州省科学技术基金项目（黔科合J字[2014]2125号）；贵州省教育厅青年科技人才成长项目（黔教合KY字[2016]130. |
| |
| 摘 要： | 在模是大合数的情况下,求二次剩余平方根是一个困难问题.目前已知的求二次剩余平方根的算法有两种,本文对Cocks和曹珍富的算法进行分析比较,结果表明由Cocks提出的算法效率更高,这对今后求二次剩余平方根时进行算法选择提供了帮助.
|
| 关 键 词： | 模 二次剩余 平方根 中国剩余定理 |
| 收稿时间： | 2018/5/18 0:00:00 |
Comparison of Two Algorithms for Finding the Quadratic Residue Square Root |
| |
| CAI Zhao-zheng,QU Yun-yun,BAO Xiao-min.Comparison of Two Algorithms for Finding the Quadratic Residue Square Root[J].Journal of Southwest Agricultural University,2019,41(1):60-64. |
| |
| Authors: | CAI Zhao-zheng QU Yun-yun BAO Xiao-min |
| |
| Institution: | 1. School of Mathematics and Statistics, Southwest University, Chongqing 400715, China;2. School of Mathematical Science, Guizhou Normal University, Guiyang, Guizhou 550001, China |
| |
| Abstract: | In the case of a large composite number of modules, to find the quadratic residue root is a difficult problem. There are two kinds of algorithms that are known for finding the square root of quadratic residuals. In this paper, the two known algorithms are analyzed and compared, and the results show that the algorithm 1 proposed by Cocks is more efficient than the algorithm 2 proposed by Cao Zhenfu, et al. |
| |
| Keywords: | module quadratic residue square root Chinese remainder theorem |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《西南农业大学学报》浏览原始摘要信息 |
| 点击此处可从《西南农业大学学报》下载免费的PDF全文 |
