Jian-Kao Chen

Learn More
In this paper, a new efficient VLSI archtecture to compute RSA public-key cryptosystem is proposed. The modified H-algorithm is applied to fmd the modular exponentiation. By this modified H-algorithm, the modular multiplication steps reduced about 5dl8. For the modular multiplication the L-algorithm (LSB first) is used. In the architecture of the modular(More)
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(More)
  • 1