Efficient parallel modular exponentiation algorithm

被引：0

作者：

Nedjah, N ^{[1
]}

Mourelle, LD ^{[1
]}

机构：

[1] State Univ Rio de Janeiro, Fac Engn, Dept Syst Engn & Computat, Rio De Janeiro, Brazil

来源：

ADVANCES IN INFORMATION SYSTEMS | 2002年 / 2457卷

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Modular exponentiation is fundamental to several public-key cryptography systems such as the RSA encryption system, as well as the most dominant part of the computation performed. The operation is time consuming for large operands. This paper analyses and compares the complexity of a variety of algorithms proposed to compute the modular exponentiation of a relatively large binary number, and proposes a new parallel modular exponentiation method.

引用

页码：405 / 414

页数：10

共 13 条

[1]

BOS J, 1990, LECT NOTES COMPUT SC, V435, P400

[2]

DOWNEY P, 1981, SIAM J COMPUT, V3, P638

[3]

KALISKI BS, 1993, DR DOBBS J, V50, P58

[4]

KNUTH DE, 1981, ART PROGRAMMING SEMI, V2