IEEE Transactions on Parallel and Distributed Systems · 1995 · 139 citations · 6 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingComputational Number TheoryReduction OperationsApplications In CryptographyPublic-key EncryptionReduced Residue SystemsReductionsResidue Number System AlgorithmsResidue Number Systems
Residue number systems provide a good means for extremely long integer arithmetic. Their carry-free operations make parallel implementations feasible. Some applications involving very long integers, such as public key encryption, rely heavily on fast modulo reductions. This paper shows a new combination of residue number systems with efficient modulo reduction methods. Two methods are compared, and the faster one is scrutinized in detail. Both methods have the same order of complexity, O(log n), with n denoting the amount of registers involved.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
6
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Residue Arithmetic A Tutorial with Examples
Base extension using a convolution sum in residue number systems
K.C. Posch, Reinhard Posch · Computing · 1993 · 35 citations