Stehlé-Zimmermann algorithm: Difference between revisions

Line 1:

An algorithm for calculating the [[http://en.wikipedia.org/wiki/Jacobi_symbol 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.

An algorithm for calculating the [http://en.wikipedia.org/wiki/Jacobi_symbol 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==

Revision as of 01:51, 10 September 2011 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,305 edits Created page with "An algorithm for calculating the http://en.wikipedia.org/wiki/Jacobi_symbol Jacobi symbol of two n-digit numbers in O(lg n M(n)) time, where M(n) is the complexity of a chose..."		Latest revision as of 01:52, 10 September 2011 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,305 edits No edit summary
Line 1:		Line 1:
	An algorithm for calculating the [[http://en.wikipedia.org/wiki/Jacobi_symbol 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.		An algorithm for calculating the [http://en.wikipedia.org/wiki/Jacobi_symbol 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==		==See Also==

Stehlé-Zimmermann algorithm: Difference between revisions

Dank (talk | contribs)