完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, CCen_US
dc.contributor.authorChang, TSen_US
dc.contributor.authorJen, CWen_US
dc.date.accessioned2014-12-08T15:48:54Z-
dc.date.available2014-12-08T15:48:54Z-
dc.date.issued1998-07-01en_US
dc.identifier.issn1057-7130en_US
dc.identifier.urihttp://dx.doi.org/10.1109/82.700944en_US
dc.identifier.urihttp://hdl.handle.net/11536/32521-
dc.description.abstractIn this paper, we propose a new algorithm based on Montgomery's algorithm to calculate modular multiplication that is the core arithmetic operation in an RSA cryptosystem. The modified algorithm eliminates over-large residue and has very short critical path delay that yields a very high-speed processing. The nevi architecture based on this modified algorithm takes about 1.5n(2) clock cycles on the average to finish one n-bit RSA operation. We have implemented a 512-bit single-chip RSA processor based on the modified algorithm with Compass 0.6-mu m SPDM CMOS cell library. The simulation results show that the processor can operate up to 125 MHz and deliver the baud rate of 164 Kbits/s on the average.en_US
dc.language.isoen_USen_US
dc.titleNew RSA cryptosystem hardware design based on Montgomery's algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/82.700944en_US
dc.identifier.journalIEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSINGen_US
dc.citation.volume45en_US
dc.citation.issue7en_US
dc.citation.spage908en_US
dc.citation.epage913en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000074747400020-
dc.citation.woscount38-
顯示於類別:期刊論文


文件中的檔案:

  1. 000074747400020.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。