【摘要】 介绍了大数幂剩余的Montgomery算法,提出了基于二进制冗余数的大数幂剩余Montgomery算法模型。理论分析表明,采用二进制冗余数可减少乘法的进位传播,同时使算法的迭代步数减少17.2%。进一步提高了大数幂剩余的运算速度。更多还原

【Abstract】 The Montgomery algorithm used in modular exponentiation with very large operand is briefly introduced. A new Montgomery algorithm is presented for modular exponentiation computation with very large operand based on binary redundant representations. Computation of modular exponentiation with very large operand is furthermore speeded up by decreasing recursive steps and carry propagation in modular multiplication.It is shown by theoretical analysis that recursive stops are also decreased by 17.2% on average.更多还原