大数幂剩余的二进制冗余数Montgomery算法  

A New Montgomery Algorithm Based on Binary Redundant Representations for Modular Exponentiation with Very Large Operand

作　　者：陈运[1] 龚耀寰[1] 

机构地区：[1]电子科技大学通信与信息工程学院,电子工程学院成都610054

出　　处：《电子科技大学学报》2000年第6期587-590,共4页Journal of University of Electronic Science and Technology of China

基　　金：电子部预研基金

摘　　要：介绍了大数幂剩余的Montgomery算法,提出了基于二进制冗余数的大数幂剩余Montgomery算法模型。理论分析表明,采用二进制冗余数可减少乘法的进位传播,同时使算法的迭代步数减少17.2%。进一步提高了大数幂剩余的运算速度。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.

关 键 词：密码学 幂剩余 MONTGOMERY算法 二进制冗余数 

分 类 号：TN918.1[电子电信—通信与信息系统]