ECC Coprocessor Over a NIST Prime Field Using Fast Partial Montgomery Reduction
- Authors
- Choi, Piljoo; Lee, Mun-Kyu; Kim, Dong Kyue
- Issue Date
- Mar-2021
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Elliptic curve cryptography (ECC); finite field; Montgomery reduction; national institute of standards and technology (NIST) primes; partial modular reduction
- Citation
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, v.68, no.3, pp.1206 - 1216
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS
- Volume
- 68
- Number
- 3
- Start Page
- 1206
- End Page
- 1216
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/7984
- DOI
- 10.1109/TCSI.2020.3039753
- ISSN
- 1549-8328
- Abstract
- Montgomery reduction is a well-known optimization technique for modular reduction over prime fields. However, it has rarely been used for national institute of standards and technology (NIST) prime fields, because the special structure of NIST primes enables fast reduction that requires fewer computations than Montgomery reduction. In this study, we rediscover the Montgomery reduction for NIST primes and propose a new modular reduction method by applying partial modular reduction to Montgomery reduction. Using this new modular reduction method and other optimization techniques, such as pipelining and parallel processing, we propose an efficient elliptic curve cryptography (ECC) coprocessor over NIST prime fields. The implementation results indicate that the proposed coprocessor can perform one elliptic curve point multiplication in 0.055 ms with only 194.7 k gate counts. This is a considerably higher speed per area compared to previous research.
- 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/7984)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.