Indexed metadata
Modular multiplication without trial division
Peter L. Montgomery
Source record
Source: Crossref
Published: Jan 1, 1985
DOI: 10.1090/s0025-5718-1985-0777282-x
Open original source ↗Source abstract
Let N > 1 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.