article Open AccessTop 10% cited
Modular Multiplication Without Trial Division
Mathematics of Computation · 1985 · Vol. 44(170) · pp. 519–519
Abstract
Let N > 1.We present a method for multiplying two integers (called N-residues) modulo N while avoiding division by N. N-residues are represented in a nonstandard way, so this method is useful only if several computations are done modulo one N.The addition and subtraction algorithms are unchanged.
Numerical Methods and AlgorithmsCryptography and Residue ArithmeticDigital Filter Design and ImplementationMathematicsModuloDivision (mathematics)Multiplication (music)Modular arithmeticArithmeticSubtractionModulo operationComputationModular design
Citations
1,104
FWCI
3.12
field-weighted impact
References
8
Percentile
93%
vs. same field & year
Citations per year
Cited by
Speeding the Pollard and elliptic curve methods of factorization
Mathematics of Computation · 1987 · 1,170 citations
References
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM · 1983 · 13,110 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.