Parallel computation of modular exponentiation for fast cryptography

Authors:
Nadia Nedjah;Luiza de Macedo Mourelle
Affiliations:
Faculty of Engineering, State University of Rio de Janeiro, Rio de Janeiro, Brazil.;Faculty of Engineering, State University of Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
International Journal of High Performance Systems Architecture
Year:
2007

Citing 3
Cited 2

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 hardware of the sliding-window method for parallel computation of modular exponentiations

International Journal of Parallel Programming - Special issue on the 19th international symposium on computer architecture and high performance computing (SBAC-PAD 2007)
Parallel modular exponentiation using load balancing without precomputation

Journal of Computer and System Sciences

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.