1 / 3

Fast Truncated Multiplication & Crypto Applications Laszlo Hars (Seagate Research)

Fast Truncated Multiplication & Crypto Applications Laszlo Hars (Seagate Research). www.hars.us/Papers/Truncated Products.pdf Karatsuba, Toom-Cook not used much Complex / Slow for short numbers Mod Mult = 3 Mult time  ≈ 2.

eurydice
Download Presentation

Fast Truncated Multiplication & Crypto Applications Laszlo Hars (Seagate Research)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fast Truncated Multiplication & Crypto ApplicationsLaszlo Hars (Seagate Research) • www.hars.us/Papers/Truncated Products.pdf • Karatsuba, Toom-Cook not used much • Complex / Slow for short numbers • Mod Mult = 3 Mult time  ≈ 2 • Sub-quadratic multiplications:many non-multiplicative operations • Complexity paradox:faster multiplication from pieces • Do NO more auxiliary operationsthan in the multiplication!

  2. Reciprocal recursion r2k = rk || rk(rk-x(2k)) • Barrett’s multiplication: ab mod m =ab−[ab/m]m = LS(ab)−(MS(ab)µ)m • β = MS2n(b/m), ab mod m = (aβ)m • Montgomery multiplication abd−n mod m = MS(ab)−(LS(ab)(−m−1))m • β= b(−m−1), abd−nmodm = ab−(aβ)m

  3. In the Paper • Carry estimate, exact rounding for truncated products • Equivalence of LS and MS halfproducts, within a linear term • Truncated polynomial product algorithms adapted to long integers(half products, middle third products, third quarter products) • Lengths of MS and LS truncated products, faster than the full product • Fast initialization of the Newton reciprocal algorithm • Newton's reciprocal algorithm with only truncated product arithmetic (no external additions or subtractions) • Fast long integer division algorithms • Accelerated Barrett multiplication with Karatsuba complexity and faster • Barrett multiplication with constant • Sub-quadratic Montgomery multiplication • Montgomery multiplication with constant • Fast quad-length mod-multiplications on short arithmetic co-processors

More Related