完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChung, Szu-Chien_US
dc.contributor.authorLee, Jen-Weien_US
dc.contributor.authorChang, Hsie-Chiaen_US
dc.contributor.authorLee, Chen-Yien_US
dc.date.accessioned2014-12-08T15:30:05Z-
dc.date.available2014-12-08T15:30:05Z-
dc.date.issued2012en_US
dc.identifier.isbn978-1-4673-0219-7en_US
dc.identifier.issn0271-4302en_US
dc.identifier.urihttp://hdl.handle.net/11536/21565-
dc.description.abstractIn order to support high speed application such as cloud computing, we propose a new elliptic curve cryptographic (ECC) processor architecture. The proposed processor includes a 3 pipelined-stage full-word Montgomery multiplier which requires much fewer execution cycles than that of previous methods. To reach real-time requirement, the time-cost pre-computation steps of Montgomery modular multiplication are achieved by hardware as well. Moreover, our proposed processor is resistant to the simple power analysis (SPA) attack by using the Montgomery ladder-based elliptic curve scalar multiplication (ECSM). Even the Montgomery ladder method inherently has operation overhead compared with traditional binary ECSM, both of hardware sharing and parallelization techniques are exploited to improve the hardware performance. Synthesized in TSMC 90nm CMOS technology, our proposed ECC processor performs a 256-bit ECSM in 120 mu s over prime field with 540K gate counts. This result is at least 25% better than relative works in terms of area-time (AT) product.en_US
dc.language.isoen_USen_US
dc.titleA High-Performance Elliptic Curve Cryptographic Processor over GF(p) with SPA Resistanceen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012)en_US
dc.citation.spage1456en_US
dc.citation.epage1459en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000316903701168-
顯示於類別:會議論文