A new carry-free division algorithm and its application to a single-chip 1024-b RSA processor
A new carry-free division algorithm and its application to a single-chip 1024-b RSA processor
复制标题
一种新的无进位除法算法及其在单片1024-b RSA处理器中的应用
DOI：
10.1109/4.102670
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
P. Jespers
中科院分区：
文献类型：
--
作者：
A. Vandemeulebroecke;E. Vanzieleghem;T. Denayer;C. Trullemans;P. Jespers
提出了一种无进位除法算法。它基于冗余符号数（RSD）算法的性质，以避免进位传播，并使用最少的硬件每比特，即一个全加器。它的应用1024-B RSA（Rivest，Shamir，和Adelman）密码芯片。这种新算法的特点允许高性能（8 kb/s的1024-B字），以获得相对较小的面积和功耗（80 mm/sup 2/2-μ m CMOS工艺和500 mW在25 MHz）。>
A carry-free division algorithm is described. It is based on the properties of redundant signed digit (RSD) arithmetic to avoid carry propagation and uses the minimum hardware per bit, i.e. one full adder. Its application to a 1024-b RSA (Rivest, Shamir, and Adelman) cryptographic chip is presented. The features of this new algorithm allowed high performance (8 kb/s for 1024-b words) to be obtained for relatively small area and power consumption (80 mm/sup 2/ in a 2- mu m CMOS process and 500 mW at 25 MHz). >