On Multiple Precision Based Montgomery Multiplication without Precomputation of N0' = -N0-1 mod W

Authors:
Affiliations:
Venue:
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Year:
2000

Citing 7
Cited 0

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
Analyzing and Comparing Montgomery Multiplication Algorithms

IEEE Micro
SCALPS: Smart Card for Limited Payment Systems

IEEE Micro
RSA Acceleration with Field Programmable Gate Arrays

ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
FPGA-Based Architecture Evaluation of Cryptographic Coprocessors for Smartcards

FCCM '98 Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines

Quantified Score

Hi-index	0.01

Visualization

Abstract

An efficient implementation of modular exponentiation, i.e., the main building block of many public key cryptographic devices, is achieved by algorithmic optimization of the Montgomery modular multiplication algorithm based on multiple precision such that pre-computation of N0麓 = - N0 -1 mod W can be avoided. This can be attained by modifications of the multiplier used.