English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58317/91854 (63%)
造访人次 : 14018144      在线人数 : 157
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/52822


    题名: An Efficient VLSI Architecture for Rivest-Shamir-Adleman Public-key Cryptosystem
    作者: 江正雄;Chiang, Jen-shiun;簡丞志;Chien, Cheng-chih;Chen, Jian-kao;周信國;Chou, Hsin-guo
    贡献者: 淡江大學電機工程學系
    关键词: Data Security;H-algorithm;L-algorithm;Modular Exponentiation;Modular Multiplication;Montgomery's Algorithm;Public-key Cryptosystem;RSA;VLSI
    日期: 2004-12-01
    上传时间: 2010-12-01 10:35:56 (UTC+8)
    出版者: 臺北縣:淡江大學
    摘要: In this paper, a new efficient VLSI architecture to compute modular exponentiation and modular multiplication for Rivest-Shamir-Adleman (RSA) public-key cryptosystem is proposed. We modify the conventional H-algorithm to find the modular exponentiation. By this modified H-algorithm, the modular multiplication steps for n-bit numbers are reduced by 5n/18 times. For the modular multiplication a modified L-algorithm (LSB first) is used. In the architecture of the modified modular multiplication the iteration times are only half of Montgomery's algorithm and the H-algorithm. The proposed architecture for the RSA public-key crypto-system has a data rate of 146 kb/s for 512-b words with a 200-MHz clock rate.
    關聯: 淡江理工學刊=Tamkang journal of science and engineering 7(4),頁241-250
    DOI: 10.6180/jase.2004.7.4.07
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    1560-6686_7-4-7.pdf341KbAdobe PDF251检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈