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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Carnahan Conference on Security Technology
EditorsL.D. Sanson
Pages221-225
Number of pages5
Publication statusPublished - 2004
EventProceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology - Albuquerque, NM, United States
Duration: 2004 Oct 112004 Oct 14

Other

OtherProceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology
CountryUnited States
CityAlbuquerque, NM
Period04/10/1104/10/14

Fingerprint

Public key cryptography
Cryptography
Hardware
Networks (circuits)
Computer systems
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hisakado, T., Kobayashi, N., Ikenaga, T., Baba, T., Goto, S., Higashi, K., ... Tsunoo, Y. (2004). N bit-wise modular multiplier architecture for public key cryptography. In L. D. Sanson (Ed.), Proceedings - International Carnahan Conference on Security Technology (pp. 221-225)

N bit-wise modular multiplier architecture for public key cryptography. / Hisakado, Tohru; Kobayashi, Nobuyuki; Ikenaga, Takeshi; Baba, Takaaki; Goto, Satoshi; Higashi, Kunihiko; Kitao, Ichiro; Tsunoo, Yukiyasu.

Proceedings - International Carnahan Conference on Security Technology. ed. / L.D. Sanson. 2004. p. 221-225.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hisakado, T, Kobayashi, N, Ikenaga, T, Baba, T, Goto, S, Higashi, K, Kitao, I & Tsunoo, Y 2004, N bit-wise modular multiplier architecture for public key cryptography. in LD Sanson (ed.), Proceedings - International Carnahan Conference on Security Technology. pp. 221-225, Proceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology, Albuquerque, NM, United States, 04/10/11.
Hisakado T, Kobayashi N, Ikenaga T, Baba T, Goto S, Higashi K et al. N bit-wise modular multiplier architecture for public key cryptography. In Sanson LD, editor, Proceedings - International Carnahan Conference on Security Technology. 2004. p. 221-225
Hisakado, Tohru ; Kobayashi, Nobuyuki ; Ikenaga, Takeshi ; Baba, Takaaki ; Goto, Satoshi ; Higashi, Kunihiko ; Kitao, Ichiro ; Tsunoo, Yukiyasu. / N bit-wise modular multiplier architecture for public key cryptography. Proceedings - International Carnahan Conference on Security Technology. editor / L.D. Sanson. 2004. pp. 221-225
@inproceedings{90f34a60b2f4421aa194002709d82bf3,
title = "N bit-wise modular multiplier architecture for public key cryptography",
abstract = "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.",
author = "Tohru Hisakado and Nobuyuki Kobayashi and Takeshi Ikenaga and Takaaki Baba and Satoshi Goto and Kunihiko Higashi and Ichiro Kitao and Yukiyasu Tsunoo",
year = "2004",
language = "English",
pages = "221--225",
editor = "L.D. Sanson",
booktitle = "Proceedings - International Carnahan Conference on Security Technology",

}

TY - GEN

T1 - N bit-wise modular multiplier architecture for public key cryptography

AU - Hisakado, Tohru

AU - Kobayashi, Nobuyuki

AU - Ikenaga, Takeshi

AU - Baba, Takaaki

AU - Goto, Satoshi

AU - Higashi, Kunihiko

AU - Kitao, Ichiro

AU - Tsunoo, Yukiyasu

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=16244369112&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=16244369112&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:16244369112

SP - 221

EP - 225

BT - Proceedings - International Carnahan Conference on Security Technology

A2 - Sanson, L.D.

ER -