Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2008.15-C.6.507

Design of High Speed Modular Exponentiation Operation Method for RSA Algorithm  

Kim, Kap-Yol (경원대학교 전자계산학과)
Lee, Chul-Soo (경원대학교 컴퓨터 소프트웨어학과)
Park, Seok-Cheon (경원대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartC / v.15C, no.6, 2008 , pp. 507-512 More about this Journal
Abstract
At a recent, enterprises based on online-service are established because of rapid growth of information network. These enterprises collect personal information and do customer management. If customers use a paid service, company send billing information to customer and customer pay it. Such circulation and management of information is big issue but most companies don't care of information security. Actually, personal information that was managed by largest internal open-market was exposed. For safe customer information management, this paper proposes the method that decrease load of RSA cryptography algorithm that is commonly used for preventing from illegal attack or hacking. The method for decreasing load was designed by Binary NAF Method and it can operates modular Exponentiation rapidly. We implemented modular Exponentiation algorithm using existing Binary Method and Windows Method and compared and evaluated it.
Keywords
RSA; ECC; Montgomery; Binary NAF;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 이주철, “정보보호와 전자문서 유통확대를 위한 전자서명의 효율적 이용방안”, 전북대학교 학위논문, pp.18-19, 2006. 2
2 민병관, “암호화 기술의 최근 동향”, 전자부품연구원, pp.3-4, 2004. 02. 19
3 F. Al-Somani and M. K. Ibrahim, “High Performance Elliptic Curve GF(2m) Cryptoprocessor Secure Against Timing Attacks,” IJCSNS, Vol.6, No.1B, pp.179-181, 2006
4 http://en.wikipedia.org/wiki/Non-adjacent_form
5 http://en.wikipedia.org/wiki/Euclidean_algorithm
6 JH Yang and CC Chang, “Efficient residue number system iterative modular multiplication algorithm for fast modular exponentiation,” Computers & Digital Techniques, pp.4-5, November, 20, 2008
7 A.J Menezes, P.C Van Oorschot and S.A Vanstorne, “Handbook of Applied Cryptography,” CRC Press, Boca Raton, Florida, pp.175, pp.285-290, 1997
8 원동호 외, “전자결재용 서명 고속화를 위한 32비트 고속연산 S/W 개발”, 한국정보보호센터, pp.5-7, 1997. 9
9 R. Rivest, A. Rhamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public-key Cryptosystems,” Communications of the ACM, pp.8-10, February, 1978
10 http://ko.wikipedia.org/wiki/RSA
11 Naofumi Homma et al, “Collision-based Power Analysis of Modular Exponentiation Using Chosen-message Pairs,” CHES2008, LNCS5154, pp.15-29, August, 2008   DOI   ScienceOn
12 곽미숙, “정보보호에서의 기술적 보안(암호화 기법)”, 서울대학교의과대학, pp.3-9, 2005. 10. 25
13 P. Findlay and B. Johnson, “Modular exponentiation using recursive sums of residues,” in Crypto 89, pp.371-386, 1990   DOI
14 이광호 외, “개선된 확장 유클리드 알고리듬을 이용한 유한체 나눗셈 연산기의 하드웨어 설계”, 한국정보과학회 학술대회, pp.64-65, 2005. 11   과학기술학회마을