Efficient Parallel Modular Exponentiation Algorithm

Authors:
Nadia Nedjah;Luiza de Macedo Mourelle
Affiliations:
-;-
Venue:
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Year:
2002

Citing 3
Cited 5

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Addition Chain Heuristics

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology

High-performance SoC-based implementation of modular exponentiation using evolutionary addition chains for efficient cryptography

Applied Soft Computing
Parallel modular exponentiation using load balancing without precomputation

Journal of Computer and System Sciences
Efficient pre-processing for large window-based modular exponentiation using ant colony

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
A massively parallel hardware for modular exponentiations using the m-ary method

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A mutation-selection algorithm for the problem of minimum brauer chains

MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.