New modular multiplication algorithms for fast modular exponentiation

Authors:
Seong-Min Hong;Sang-Yeop Oh;Hyunsoo Yoon
Affiliations:
Department of Computer Science and Center for AI Research Korea Advanced Institute of Science and Technology, Taejeon, Korea;Department of Computer Science and Center for AI Research Korea Advanced Institute of Science and Technology, Taejeon, Korea;Department of Computer Science and Center for AI Research Korea Advanced Institute of Science and Technology, Taejeon, Korea
Venue:
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Year:
1996

Citing 7
Cited 1

Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
Exponentiating faster with addition chains

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A cryptographic library for the Motorola DSP56000

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Comparison of three modular reduction functions

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Modular Exponentiation Using Recursive Sums of Residues

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

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

Low-Weight Polynomial Form Integers for Efficient Modular Multiplication

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

A modular exponentiation is one of the most important operations in public-key cryptography. However, it takes much time because the modular exponentiation deals with very large operands as 512-bit integers. The modular exponentiation is composed of repetition of modular multiplications. Therefore, we can rcducc the execution time of it by reducing thc execution time of each modular multiplication. In this paper, we propose two fast modular multiplication algorithms. One is for modular multiplications between different integers, and the other is for modular squarings. These proposed algorithms require single-precision multiplications fewer than those of Montgomery modular multiplication algorithms by 1/2 and 1/3 times, respectively. Implementing on PC, proposed algorithms reduce execution times by 50% and 30% compared with Montgomery algorithms, respectively.