[[alternative]]具高效能RSA公開金匙編碼系統之超大型積體電路架構

[[abstract]]In this paper, a new efficient VLSI architecture to compute RSA public-key cryptosystem is proposed. The modified H-algorithm is applied to find the modular exponentiation. By this modified H-algorithm, the modular multiplication steps were reduced by about 5n/18. For the modular multiplication the L-algorithm (LSB first) is used. In the architecture of the modular multiplication the iteration times are only half of Montgomery's algorithm and the H-algorithm. By this arrangement, this architecture of RSA has a very good area-time product.[[conferencetype]]國際[[conferencedate]]19990530~19990602[[booktype]]紙本[[conferencelocation]]Orlando, FL, US