Fast computation of the biquadratic residue symbol.

DOI10.1006/jnth.2002.2783zbMath1043.11003OpenAlexW2024918898MaRDI QIDQ1864853

Weilert, André

Publication date: 23 March 2003

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.2002.2783

zbMATH Keywords

reciprocity lawJacobi symbolEuclidean algorithmbiquadratic residue symbolfast GCD algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Evaluation of number-theoretic constants (11Y60) Power residues, reciprocity (11A15)

Related Items (5)

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ An O(M(n) logn) Algorithm for the Jacobi Symbol ⋮ New number-theoretic cryptographic primitives ⋮ The eleventh power residue symbol ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders

Cites Work

• Fast multiplication of large numbers
• Fast computation of continued fraction expansions.
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast computation of the biquadratic residue symbol.