Efficient multiple-precision integer division algorithm

作     者：Mukhopadhyay, Debapriyay Nandy, Subhas C. 

作者机构：IXIA Technol Pvt Ltd Kolkata 700091 India Indian Stat Inst Kolkata 700108 India 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：2014年第114卷第3期

页      面：152-157页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Division algorithm Normalization Computational arithmetic Cryptography 

摘      要：Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1]. (C) 2013 Elsevier BM. All rights reserved.