Short Division of Long Integers

David Harvey Paul Zimmermann 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We consider the problem of short division --- division without remainder --- of multiple-precision integers. We present ready-to-be-implemented algorithms that yield an approximation of the quotient, with tight and rigorous error bounds. We exhibit speedups of up to 30% with respect to GMP division with remainder, and up to 10% with respect to GMP short division, with room for further improvements. This work enables one to implement fast correctly rounded division routines in multiple-precision software tools.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00612232
Contributor : Paul Zimmermann <>
Submitted on : Thursday, July 28, 2011 - 1:16:13 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM

Links full text

Identifiers

Collections

Citation

David Harvey, Paul Zimmermann. Short Division of Long Integers. 20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩. ⟨inria-00612232⟩

Share

Metrics

Record views

471