计算机工程2012，Vol.38Issue(16)：121-123,3.DOI:10.3969/j.issn.1000-3428.2012.16.030
改进的大整数相乘快速算法
Improved Fast Algorithm for Large Integer Multiplication
摘要
Abstract
This paper focus on the algorithm to reduce the number of multiplication for two numbers and thus reduces the computational complexity from O(n) to 0(1). According to different addition operation methods, two improved algorithms(ie. cumulative sum and uniform sum) are introduced and their time-cost is compared with that of the current large integer multiplication algorithm.关键词
大整数相乘/分治法/累加求和/快速算法/统一求和Key words
large integer multiplication/ divide and conquer algorithm/ cumulative summing/ fast algorithm/ uniform summing分类
信息技术与安全科学引用本文复制引用
周健,李顺东,薛丹..改进的大整数相乘快速算法[J].计算机工程,2012,38(16):121-123,3.基金项目
国家自然科学基金资助项目“高性能保密计算算法与协议研究”(61070189) （61070189）
陕西省科技攻关基金资助项目“用数据挖掘研究地震余震预报与综合评判”(2008K01-58) （2008K01-58）
