Fast computation of the biquadratic residue symbol. (Q1864853): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of the biquadratic residue symbol. |
scientific article |
Statements
Fast computation of the biquadratic residue symbol. (English)
0 references
23 March 2003
0 references
As in an earlier work by the author [\textit{A. Weilert}, Lect. Notes Comput. Sci. 1838, 595--613 (2000; Zbl 1032.11063)] the biquadratic residue symbol is extracted from the quotient sequence arising from the Euclidean descent for the G.C.D. Run time, using fast algorithms, is \(O(n(\log n)^2\log\log n)\) for Gaussian integers bounded by \(2^n\) in the norm.
0 references
Euclidean algorithm
0 references
reciprocity law
0 references
fast GCD algorithm
0 references
biquadratic residue symbol
0 references
Jacobi symbol
0 references
