Corpus ID: 13657993

Efficient long division via Montgomery multiply

@article{Mayer2013EfficientLD,
  title={Efficient long division via Montgomery multiply},
  author={Ernst W. Mayer},
  journal={ArXiv},
  year={2013},
  volume={abs/1303.0328}
}
  • Ernst W. Mayer
  • Published 2013
  • Computer Science
  • ArXiv
  • We present a novel right-to-left long division algorithm based on the Montgomery modular multiply, consisting of separate highly efficient loops with simply carry structure for computing first the remainder (x mod q) and then the quotient floor(x/q). These loops are ideally suited for the case where x occupies many more machine words than the divide modulus q, and are strictly linear time in the "bitsize ratio" lg(x)/lg(q). For the paradigmatic performance test of multiword dividend and single… CONTINUE READING
    Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors
    • 2
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    Modular multiplication without trial division
    • 2,381
    • PDF
    Handbook of Applied Cryptography
    • 10,842
    • PDF
    Improved Division by Invariant Integers
    • 43
    • PDF
    Theorie der algebraischen Zahlen
    • 20
    • Highly Influential
    • PDF
    Seminumerical Algorithms 2nd Ed. (TAOCP Series
    • 1981
    Fourth Known Factor of M(M31)
    • 2005
    Fourth Known Factor of M(M31). NMBRTHRY mailing list
    • 2005
    GMP instruction timing assembly chart