CAJ | 학술논문

本文研究了RSA密码体制的核心算法，提出了该核心算法在处理大数运算时速度太慢的问题。 RSA加密体制执行的效率很大程度取决于快速进行模幂运算，模幂运算又相当于模乘运算的循环，蒙哥马利模乘运算利用二进制数的位移原理解决了快速模乘问题。根据蒙哥马利模乘运算的原理，验证了蒙哥马利算法提高RSA加密体制的实际效率。
본문연구료RSA밀마체제적핵심산법，제출료해핵심산법재처리대수운산시속도태만적문제。 RSA가밀체제집행적효솔흔대정도취결우쾌속진행모멱운산，모멱운산우상당우모승운산적순배，몽가마리모승운산이용이진제수적위이원리해결료쾌속모승문제。근거몽가마리모승운산적원리，험증료몽가마리산법제고RSA가밀체제적실제효솔。
This paper studies the core algorithm of RSA cipher system , and analyzes the speed of core algorithm in dealing with prob-lems of large number operation is too slow .RSA encryption system execution efficiency depends on fast modular exponentiation to a great extent , and modular exponentiation is equivalent to the cycle of modular multiplication .Montgomery modular multiplication using a binary number solved the problem of fast modular multiplication .According to the principle of Montgomery modular multiplication , we verify that the Montgomerie algorithm can improve the practical efficiency of RSA encryption system .