High-speed algorithms for public-key cryptosystems

Author

Joseph, G. ; Penzhorn, W.T.

Author_Institution

Dept. of Electr. Electron. & Comput. Eng., Pretoria Univ., South Africa

Volume

2

fYear

2004

fDate

15-17 Sept. 2004

Firstpage

945

Abstract

The modular exponentiation is one of the most important operations in public-key cryptosystems. A modular exponentiation is composed of repetition of modular multiplications. Again, the modular multiplication consists of a multiprecision multiplication and a modular reduction. Therefore, we can reduce the execution time of the modular exponentiation by two methods. One is to reduce the number of modular multiplications and the other is to reduce the execution time of the modular multiplication. In this paper we investigate high-speed mathematical algorithms that focus on the multiplication, reduction and exponentiation operations to reduce the execution time of the modular exponentiation.

Keywords

public key cryptography; telecommunication security; addition chain length; execution time; high-speed mathematical algorithm; modular exponentiation; modular multiplication; modular reduction; multiprecision multiplication; public-key cryptosystem; Acceleration; Africa; Algorithm design and analysis; Digital signatures; Mathematical model; Performance analysis; Public key; Public key cryptography; Read-write memory; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

AFRICON, 2004. 7th AFRICON Conference in Africa

Print_ISBN

0-7803-8605-1

Type

conf

DOI

10.1109/AFRICON.2004.1406825

Filename

1406825