Efficient hardware implementation of modular multiplication and exponentiation for public-key cryptography

Authors:
Nadia Nedjah;Luiza De Macedo Mourelle
Affiliations:
Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro;Department of Systems Engineering and Computation, Faculty of Engineering, State University of Rio de Janeiro
Venue:
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Year:
2002

Citing 9
Cited 0

Digital integrated circuits: a design perspective

Digital integrated circuits: a design perspective
A survey of fast exponentiation methods

Journal of Algorithms
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
VHDL: Analysis and Modeling of Digital Systems

VHDL: Analysis and Modeling of Digital Systems
Systolic Modular Multiplication

IEEE Transactions on Computers
A Survey of Hardware Implementation of RSA (Abstract)

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Montgomery Modular Exponentiation on Reconfigurable Hardware

ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Reconfigurable Hardware Implementation of Montgomery Modular Multiplication and Parallel Binary Exponentiation

DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Two Hardware Implementations for the Montgomery Modular Multiplication: Sequential versus Parallel

Proceedings of the 15th symposium on Integrated circuits and systems design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modular multiplication and modular exponentiation are fundamental operations in most public-key cryptosystems such as RSA and DSS. In this paper, we propose a novel implementation of these operations using systolic arrays based architectures. For this purpose, we use the Montgomery algorithm to compute the modular product and the left-to-right binary exponentiation method to yield the modular power. Our implementation improves time requirement as well as the time × area factor when compared that of Blums and Paars.