Fast computation of the biquadratic residue symbol.

DOI10.1006/JNTH.2002.2783MaRDI QIDQ1864853zbMATH OpenOpenAlexFDO

Authors 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

biquadratic residue symbolEuclidean algorithmfast GCD algorithmJacobi symbolreciprocity law

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1643956
• Fundamentals of Computation Theory
• An O(M(n) logn) Algorithm for the Jacobi Symbol
• A fast Euclidean algorithm for Gaussian integers
• scientific article; zbMATH DE number 1273650

Cites work

• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• Fast computation of continued fraction expansions.
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 1643956 (Why is no real title available?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• scientific article; zbMATH DE number 641702 (Why is no real title available?)
• scientific article; zbMATH DE number 1113842 (Why is no real title available?)
• scientific article; zbMATH DE number 1452559 (Why is no real title available?)

Cited in

(7)

• New number-theoretic cryptographic primitives
• The eleventh power residue symbol
• Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
• scientific article; zbMATH DE number 1643956 (Why is no real title available?)
• Two efficient algorithms for the computation of ideal sums in quadratic orders
• An O(M(n) logn) Algorithm for the Jacobi Symbol
• Higher residuosity attacks on small RSA subgroup decision problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864853)