Fast computation of the biquadratic residue symbol. (Q1864853): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jnth.2002.2783 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2024918898 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4956108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4375616 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4254917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast computation of continued fraction expansions. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4306894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast multiplication of large numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2739476 / rank | |||
Normal rank |
Latest revision as of 14:10, 5 June 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
0 references