GF(p)의 타원곡선 암호 시스템을 위한 효율적인 하드웨어 몽고메리 모듈러 역원기Efficient Hardware Montgomery Modular Inverse Module for Elliptic Curve Cryptosystem in GF(p)
- Other Titles
- Efficient Hardware Montgomery Modular Inverse Module for Elliptic Curve Cryptosystem in GF(p)
- Authors
- 최필주; 김동규
- Issue Date
- Feb-2017
- Publisher
- 한국멀티미디어학회
- Keywords
- Elliptic Curve Cryptosystem; Modular Inversion; Montgomery Inversion; Finite Field Operation
- Citation
- 멀티미디어학회논문지, v.20, no.2, pp.289 - 297
- Indexed
- KCI
- Journal Title
- 멀티미디어학회논문지
- Volume
- 20
- Number
- 2
- Start Page
- 289
- End Page
- 297
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3588
- DOI
- 10.9717/kmms.2017.20.2.289
- ISSN
- 1229-7771
- Abstract
- When implementing a hardware elliptic curve cryptosystem (ECC) module, the efficient design of Modular Inverse (MI) algorithm is especially important since it requires much more computation than other finite field operations in ECC. Among the MI algorithms, binary Right-Shift modular inverse (RS) algorithm has good performance when implemented in hardware, but Montgomery Modular Inverse (MMI) algorithm is not considered in [1, 2]. Since MMI has a similar structure to that of RS, we show that the area-improvement idea that is applied to RS is applicable to MMI, and that we can improve the speed of MMI. We designed area- and speed-improved MMI variants as hardware modules and analyzed their performance.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3588)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.