N bit-wise modular multiplier architecture for public key cryptography

Tohru Hisakado*, Nobuyuki Kobayashi, Takeshi Ikenaga, Takaaki Baba, Satoshi Goto, Kunihiko Higashi, Ichiro Kitao, Yukiyasu Tsunoo

*この研究の対応する著者

研究成果: Conference article査読

2 被引用数 (Scopus)

抄録

Along with the progress of the information society, we are relying more and more on digital information processing with security. Cryptography plays an important role in a situation where unwanted eavesdropping or falsification has to be avoided. Public key encryptions including RSA require a huge number of arithmetic operations. Major part of its operation is modular multiplication with very large bit-width. This operation takes long time, and there is an advantage in hardware implementation of it. We propose the hardware implementation of N-bit-wise multiplier. It allows the operation performed at the speed 2 times the original performance for the same circuit size, or the circuit size reduced to approximately 60% for the same processing time. Employing the architecture proposed in this paper contributes to the performance improvement of encryption system and the reduction of chip size of encryption system.

本文言語English
ページ(範囲)221-225
ページ数5
ジャーナルProceedings - International Carnahan Conference on Security Technology
出版ステータスPublished - 2004 12月 1
イベントProceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology - Albuquerque, NM, United States
継続期間: 2004 10月 112004 10月 14

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「N bit-wise modular multiplier architecture for public key cryptography」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル