Stehlé-Zimmermann algorithm

From dankwiki
Revision as of 20:52, 9 September 2011 by Dank (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

An algorithm for calculating the Jacobi symbol of two n-digit numbers in O(lg n M(n)) time, where M(n) is the complexity of a chosen multiplication algorithm for n-bit numbers.

See Also