摘要
针对RSA算法的计算密集性的特点,提出了一种简单而有效的基于迭代的实现方法,即将幂运算的模转变成乘法的模,最终转换成加法的模.它能够满足512位和1024位RSA公钥加密算法的实用要求.
A simple and effective iteration-based RSA implementation for its intensive computation is presented. This method first converts module of power computation to module of multiplication, then transforms to module of addition. It can meet the practical requirments of 512-bits and 1024-bits RSA algorithm.
出处
《苏州大学学报（自然科学版）》
CAS
2004年第1期32-36,共5页
Journal of Soochow University(Natural Science Edition)
