| 基于万进制数组的大整数乘法的算法设计 |
| |
| 引用本文： | 史庆霞,张桂芸,吴美云.基于万进制数组的大整数乘法的算法设计[J].哈尔滨师范大学自然科学学报,2012,28(1):55-57. |
| |
| 作者姓名： | 史庆霞 张桂芸 吴美云 |
| |
| 作者单位： | 天津师范大学 |
| |
| 基金项目： | 天津市教委资助项目，天津师大博士基金项目资助 |
| |
| 摘 要： | 大整数在要求高精度的应用中非常有用.在计算机数据加密技术中,常会遇到大整数的算术运算问题.为此,文章分析了大整数乘法的算法,提出了一种符号位与数值分开,万进制数组存储大整数并加以处理的算法.然后在java开发平台上测试,验证了该算法的正确性及运算的效率.
|
| 关 键 词： | 大整数乘法 万进制 数组 算法复杂度 JAVA |
The Algorithm Design of Big Integer Multiplication Based on Array of 10000 Binary |
| |
| Shi Qingxia,Zhang Guiyun,Wu Meiyun.The Algorithm Design of Big Integer Multiplication Based on Array of 10000 Binary[J].Natural Science Journal of Harbin Normal University,2012,28(1):55-57. |
| |
| Authors: | Shi Qingxia Zhang Guiyun Wu Meiyun |
| |
| Institution: | ( Tijin Normal University) |
| |
| Abstract: | Big integer is very useful in the high -precise application. There are many arithmetical problems in the encryption technologies. For this, this paper analyzes algorithm of big integer multiplication, proposes one algorithm under the help of array of 10000 binary and with separation of sign bit and value. Then, this algorithm of big integer multiplication is applied with java, it proves that the algorithm is precise and efficient in the operation test. |
| |
| Keywords: | Big integer multiplication 10000 binary Array Complexity of the algorithm Java |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
